Exact and approximation algorithms for error-detecting even codes

DOI10.1016/J.TCS.2012.03.047zbMath1245.94064OpenAlexW1986921475MaRDI QIDQ441883

Fábio Protti, Paulo Eustáquio Duarte Pinto, Jayme Luiz Szwarcfiter

Publication date: 8 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.047

zbMATH Keywords

data compressionapproximation algorithmerror detectionexact algorithmHuffman codesHamming codeseven codesprefix-free codes

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Prefix, length-variable, comma-free codes (94A45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast algorithm for optimal length-limited Huffman codes
• Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code
• Dynamic huffman coding
• Design and analysis of dynamic Huffman codes
• Variations on a theme by Huffman
• Bounding the Compression Loss of the FGK Algorithm
• Parity codes
• A Method for the Construction of Minimum-Redundancy Codes
• An optimum encoding with minimum longest code and total number of digits
• Bounding the inefficiency of length-restricted prefix codes

This page was built for publication: Exact and approximation algorithms for error-detecting even codes