2013/01/31 by Rana Ali Amjad, Amjad, Rana Ali, Georg Böcherer +1
Computer Science · Engineering · Mathematics · #Algorithm #Algorithms and Data Compression #Artificial intelligence #Coding (social sciences) #Combinatorics #Computer science #Discrete mathematics #Distribution (mathematics) #Divergence (linguistics) #Encoding (memory) #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Matching (statistics) #Mathematical analysis #Mathematics #Sequence (biology) #Statistics #Variable (mathematics) #Wireless Communication Security Techniques #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1302.0019
5 pages, essentially the ISIT 2013 version
openalex publication_date 2013/01/31 · arxiv created 2013/07/01 · arxiv updated 2013/07/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Fixed-to-variable length (f2v) matchers are used to reversibly transform an input sequence of independent and uniformly distributed bits into an output sequence of bits that are (approximately) independent and distributed according to a target distribution. The degree of approximation is measured by the informational divergence between the output distribution and the target distribution. An algorithm is developed that efficiently finds optimal f2v codes. It is shown that by encoding the input bits blockwise, the informational divergence per bit approaches zero as the block length approaches infinity. A relation to data compression by Tunstall coding is established.