Source Coding with Minimal and Rate-Independent Search and Memory Complexity

Anand D. Subramaniam, Bhaskar D. Rao. Source Coding with Minimal and Rate-Independent Search and Memory Complexity. In Data Compression Conference. pages 518, 2001. [doi]

@inproceedings{SubramaniamR01,
  title = {Source Coding with Minimal and Rate-Independent Search and Memory Complexity},
  author = {Anand D. Subramaniam and Bhaskar D. Rao},
  year = {2001},
  url = {http://computer.org/proceedings/dcc/1031/10310518.pdf},
  tags = {source-to-source, search, open-source},
  researchr = {https://researchr.org/publication/SubramaniamR01},
  cites = {0},
  citedby = {0},
  pages = {518},
  booktitle = {Data Compression Conference},
}