Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding

Amir Said. Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding. In 2005 Data Compression Conference (DCC 2005), 29-31 March 2005, Snowbird, UT, USA. pages 183-192, IEEE Computer Society, 2005. [doi]

@inproceedings{Said05,
  title = {Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding},
  author = {Amir Said},
  year = {2005},
  doi = {10.1109/DCC.2005.35},
  url = {http://doi.ieeecomputersociety.org/10.1109/DCC.2005.35},
  tags = {partitioning},
  researchr = {https://researchr.org/publication/Said05},
  cites = {0},
  citedby = {0},
  pages = {183-192},
  booktitle = {2005 Data Compression Conference (DCC 2005), 29-31 March 2005, Snowbird, UT, USA},
  publisher = {IEEE Computer Society},
  isbn = {0-7695-2309-9},
}