Abstract
For the entropy coding of independent and identically distributed (i.i.d.) binary sources, variable-to-variable length (V2V) codes are an interesting alternative to arithmetic coding. Such a V2V code translates variable length words of the source into variable length code words by employing two prefix-free codes. In this article, several properties of V2V codes are studied, and new concepts are developed. In particular, it is shown that the redundancy of a V2V code cannot be zero for a binary i.i.d. source {X} with 0 < pX(1) < 0.5. Furthermore, the concept of prime and composite V2V codes is proposed, and it is shown why composite V2V codes can be disregarded in the search for particular classes of minimum redundancy codes. Moreover, a canonical representation for V2V codes is proposed, which identifies V2V codes that have the same average code length function. It is shown how these concepts can be employed to greatly reduce the complexity of a search for minimum redundancy (size-limited) V2V codes.
- J. Abrahams. 1997. Code and parse trees for lossless source encoding. In Compression and Complexity of Sequences. 145--171. Google Scholar
Digital Library
- I. Boreico. 2008. Linear independence of radicals. Harv. Coll. Math. Rev. 2, 1 (2008), 87--92.Google Scholar
- R. R. Coifman and M. V. Wickerhauser. 1992. Entropy-based algorithms for best basis selection. IEEE Trans. Inf. Theory 38, 2 (1992), 713--718. Google Scholar
Digital Library
- J. B. Connell. 1973. A huffman-shannon-fano code. Proc. IEEE 61, 7 (Jul. 1973), 1046--1047.Google Scholar
Cross Ref
- T. Cover and J. A. Thomas. 1991. Elements of Information Theory. John Wiley 8 Sons, Inc. Google Scholar
Digital Library
- F. Fabris. 1992. Variable-length-to-variable length source coding: A greedy step-by-step algorithm. IEEE Trans. Inf. Theory 38, 5 (1992), 1609--1617. Google Scholar
Digital Library
- G. H. Freeman. 1991. Asymptotic convergence of dual-tree entropy codes. In Proceedings of the Data Compression Conference D(CC’91). 208--217.Google Scholar
Cross Ref
- G. H. Freeman. 1993. Divergence and the construction of variable-to-variable-length lossless codes by source-word extensions. In Proceedings of the Data Compression Conference (DCC’93). 79--88.Google Scholar
Cross Ref
- S. B. Guthery. 2010. A Motif of Mathematics: History and Application of the Mediant and the Farey Sequence. CreateSpace Independent Publishing Platform.Google Scholar
- D. S. Hirschberg and D. A. Lelewer. 1990. Efficient decoding of prefix codes. Commun. ACM 33, 4 (Apr. 1990), 449--459. Google Scholar
Digital Library
- D. A. Huffman. 1952. A method for the construction of minimum-redundancy codes. Proc. IRE 40, 9 (1952), 1098--1101.Google Scholar
Cross Ref
- F. Jelinek and K. Schneider. 1972. On variable-length-to-block coding. IEEE Trans. Inf. Theory 18, 6 (Nov. 1972), 765--774. Google Scholar
Digital Library
- H. Kirchhoffer. 2016. Design and Application of Variable-to-variable Length Codes. Ph.D. Dissertation. University of Rostock.Google Scholar
- L. G. Kraft. 1949. A Device for Quantizing, Grouping, and Coding Amplitude-modulated Pulses. Master’s thesis. Massachusetts Institute of Technology.Google Scholar
- L. L. Larmore and D. S. Hirschberg. 1990. A fast algorithm for optimal length-limited Huffman codes. J. ACM 37, 3 (Jul. 1990), 464--473. Google Scholar
Digital Library
- D. Marpe, H. Schwarz, and T. Wiegand. 2010. Entropy coding in video compression using probability interval partitioning. In Proceedings of the Picture Coding Symposium (PCS’10). 66--69.Google Scholar
- D. Marpe, H. Schwarz, T. Wiegand, and H. Kirchhoffer. 2014. Entropy coding. US Patent 8,907,823. (December 9 2014).Google Scholar
- J. G. Michaels and K. H. Rosen. 1991. Applications of Discrete Mathematics. McGraw-Hill, Inc. Google Scholar
Digital Library
- J. J. Rissanen. 1976. Generalized kraft inequality and arithmetic coding. IBM J. Res. Dev. 20, 3 (May 1976), 198--203. Google Scholar
Digital Library
- E. S. Schwartz and B. Kallick. 1964. Generating a canonical prefix encoding. Commun. ACM 7, 3 (Mar. 1964), 166--169. Google Scholar
Digital Library
- P. R. Stubley. 1992. Adaptive Data Compression Using Tree Codes. Ph.D. Dissertation. University of Waterloo.Google Scholar
- P. R. Stubley. 1994. Adaptive variable-to-variable length codes. In Proceedings of the Data Compression Conference (DCC’94). 98--105.Google Scholar
Cross Ref
- P. R. Stubley. 1994. On the redundancy of optimum fixed-to-variable length codes. In Proceedings of the Data Compression Conference (DCC’94). 90--97.Google Scholar
Cross Ref
- B. P. Tunstall. 1967. Synthesis of Noiseless Compression Codes. Ph.D. Dissertation. Georgia Institute of Technology.Google Scholar
- T. Wiegand and H. Schwarz. 2011. Source Coding: Part I of Fundamentals of Source and Video Coding. Now Publishers Inc.Google Scholar
Index Terms
Properties and Design of Variable-to-Variable Length Codes
Recommendations
Context-based entropy coding in AVS video coding standard
In this paper, two context-based entropy coding schemes for AVS Part-2 video coding standard are presented. One is Context-based 2D Variable Length Coding (C2DVLC) as a low complexity entropy coding scheme for AVS Part-2 Jizhun profile. C2DVLC uses ...
Variable Length Unordered Codes
In an unordered code, no code word is contained in any other code word. Unordered codes are all unidirectional error detecting (AUED) codes. In the binary case, it is well known that among all systematic codes with k information bits, Berger codes are ...
On systematic variable length unordered codes
ISIT'09: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4In an unordered code no codeword is contained in any other codeword. Unordered codes are All Unidirectional Error Detecting (AUED) codes. In the binary case, it is well known that among all systematic codes with k information bits, Berger codes are ...






Comments