{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T04:04:32Z","timestamp":1751774672657,"version":"3.41.0"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T00:00:00Z","timestamp":1532390400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Multimedia Comput. Commun. Appl."],"published-print":{"date-parts":[[2018,8,31]]},"abstract":"<jats:p>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 &lt;<jats:italic>p<jats:sub>X<\/jats:sub><\/jats:italic>(1) &lt; 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.<\/jats:p>","DOI":"10.1145\/3230653","type":"journal-article","created":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T15:50:24Z","timestamp":1532447424000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Properties and Design of Variable-to-Variable Length Codes"],"prefix":"10.1145","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4955-1263","authenticated-orcid":false,"given":"Heiner","family":"Kirchhoffer","sequence":"first","affiliation":[{"name":"Fraunhofer Institute for Telecommunications, Heinrich-Hertz-Institute, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5391-3247","authenticated-orcid":false,"given":"Detlev","family":"Marpe","sequence":"additional","affiliation":[{"name":"Fraunhofer Institute for Telecommunications, Heinrich-Hertz-Institute, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heiko","family":"Schwarz","sequence":"additional","affiliation":[{"name":"Fraunhofer Institute for Telecommunications, Heinrich-Hertz-Institute, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Wiegand","sequence":"additional","affiliation":[{"name":"Fraunhofer Institute for Telecommunications, Heinrich-Hertz-Institute, and Technical University of Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,24]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"J. Abrahams. 1997. Code and parse trees for lossless source encoding. In Compression and Complexity of Sequences. 145--171. J. Abrahams. 1997. Code and parse trees for lossless source encoding. In Compression and Complexity of Sequences. 145--171.","DOI":"10.1109\/SEQUEN.1997.666911"},{"key":"e_1_2_1_2_1","first-page":"87","article-title":"Linear independence of radicals","volume":"2","author":"Boreico I.","year":"2008","unstructured":"I. Boreico . 2008 . Linear independence of radicals . Harv. Coll. Math. Rev. 2 , 1 (2008), 87 -- 92 . I. Boreico. 2008. Linear independence of radicals. Harv. Coll. Math. Rev. 2, 1 (2008), 87--92.","journal-title":"Harv. Coll. Math. Rev."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.119732"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1973.9200"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"T. Cover and J. A. Thomas. 1991. Elements of Information Theory. John Wiley 8 Sons Inc. T. Cover and J. A. Thomas. 1991. Elements of Information Theory. John Wiley 8 Sons Inc.","DOI":"10.1002\/0471200611"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.149517"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1991.213360"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1993.253142"},{"volume-title":"A Motif of Mathematics: History and Application of the Mediant and the Farey Sequence","author":"Guthery S. B.","key":"e_1_2_1_9_1","unstructured":"S. B. Guthery . 2010. A Motif of Mathematics: History and Application of the Mediant and the Farey Sequence . CreateSpace Independent Publishing Platform . S. B. Guthery. 2010. A Motif of Mathematics: History and Application of the Mediant and the Farey Sequence. CreateSpace Independent Publishing Platform."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/77556.77566"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054899"},{"volume-title":"A Device for Quantizing, Grouping, and Coding Amplitude-modulated Pulses. Master\u2019s thesis","author":"Kraft L. G.","key":"e_1_2_1_14_1","unstructured":"L. G. Kraft . 1949. A Device for Quantizing, Grouping, and Coding Amplitude-modulated Pulses. Master\u2019s thesis . Massachusetts Institute of Technology . L. G. Kraft. 1949. A Device for Quantizing, Grouping, and Coding Amplitude-modulated Pulses. Master\u2019s thesis. Massachusetts Institute of Technology."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/79147.79150"},{"volume-title":"Proceedings of the Picture Coding Symposium (PCS\u201910)","author":"Marpe D.","key":"e_1_2_1_16_1","unstructured":"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\u201910) . 66--69. 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\u201910). 66--69."},{"key":"e_1_2_1_17_1","first-page":"907","article-title":"Entropy coding","volume":"8","author":"Marpe D.","year":"2014","unstructured":"D. Marpe , H. Schwarz , T. Wiegand , and H. Kirchhoffer . 2014 . Entropy coding . US Patent 8 , 907 ,823. (December 9 2014). D. Marpe, H. Schwarz, T. Wiegand, and H. Kirchhoffer. 2014. Entropy coding. US Patent 8,907,823. (December 9 2014).","journal-title":"US Patent"},{"key":"e_1_2_1_18_1","unstructured":"J. G. Michaels and K. H. Rosen. 1991. Applications of Discrete Mathematics. McGraw-Hill Inc. J. G. Michaels and K. H. Rosen. 1991. Applications of Discrete Mathematics. McGraw-Hill Inc."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.203.0198"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/363958.363991"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1994.305917"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1994.305916"},{"key":"e_1_2_1_25_1","volume-title":"Source Coding: Part I of Fundamentals of Source and Video Coding","author":"Wiegand T.","year":"2011","unstructured":"T. Wiegand and H. Schwarz . 2011 . Source Coding: Part I of Fundamentals of Source and Video Coding . Now Publishers Inc . T. Wiegand and H. Schwarz. 2011. Source Coding: Part I of Fundamentals of Source and Video Coding. Now Publishers Inc."}],"container-title":["ACM Transactions on Multimedia Computing, Communications, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230653","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3230653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T00:09:52Z","timestamp":1751760592000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,24]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,8,31]]}},"alternative-id":["10.1145\/3230653"],"URL":"https:\/\/doi.org\/10.1145\/3230653","relation":{},"ISSN":["1551-6857","1551-6865"],"issn-type":[{"type":"print","value":"1551-6857"},{"type":"electronic","value":"1551-6865"}],"subject":[],"published":{"date-parts":[[2018,7,24]]},"assertion":[{"value":"2017-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}