On the Reduction of Entropy Coding Complexity via Symbol Grouping : I – Redundancy Analysis and Optimal Alphabet Partition

@inproceedings{Said2004OnTR,
  title={On the Reduction of Entropy Coding Complexity via Symbol Grouping : I – Redundancy Analysis and Optimal Alphabet Partition},
  author={Amir Said},
  year={2004}
}
data compression, symbol grouping, dynamic programming, Monge matrices We analyze the technique for reducing the complexity of entropy coding that consists in the a priori grouping of the source alphabet symbols, and in the decomposition of the coding process in two stages: first coding the number of the symbol's group with a more complex method, followed by coding the symbol's rank inside its group using a less complex method, or simply using its binary representation. This technique proved to… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS