A Complete Proof of an Important Theorem for Variable-to-Variable Length Codes

2023/09/12 by Wei Yan, Yunghsiang S. Han, Yan, Wei +1
Biochemistry, Genetics and Molecular Biology · Computer Science · #Algorithms and Data Compression #Cellular Automata and Applications #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.2309.06267

openalex publication_date 2023/09/12 · openalex created_date 2023/09/14 · openalex updated_date 2026/07/28

Abstract

Variable-to-variable length (VV) codes are a class of lossless source coding. As their name implies, VV codes encode a variable-length sequence of source symbols into a variable-length codeword. This paper will give a complete proof of an important theorem for variable-to-variable length codes.

Related

• Overflow Probability of Variable-length Codes with Codeword Cost
• Variable-Length Codes Independent or Closed with respect to Edit Relations
• Almost Instantaneous Fix-to-Variable Length Codes
• Variable-Length Constrained Coding and Kraft Conditions: The Parity-Preserving Case
• Adaptive Codes: A New Class of Non-standard Variable-length Codes