Exact and approximation algorithms for error-detecting even codes

DOI10.1016/J.TCS.2012.03.047MaRDI QIDQ441883zbMATH OpenOpenAlexFDO

Authors Fábio Protti, Paulo E. D. Pinto, Jayme L. 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

approximation algorithmexact algorithmdata compressionHuffman codeserror detectionHamming codeseven codesprefix-free codes

Mathematics Subject Classification ID

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

Recommendations

• Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code
• Parity codes
• A note on the construction of error detecting/correcting prefix codes
• On even codes
• Optimal codes for error detection

Cites work

• scientific article; zbMATH DE number 3672160 (Why is no real title available?)
• scientific article; zbMATH DE number 3476581 (Why is no real title available?)
• scientific article; zbMATH DE number 3558968 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• A fast algorithm for optimal length-limited Huffman codes
• An optimum encoding with minimum longest code and total number of digits
• Bounding the Compression Loss of the FGK Algorithm
• Bounding the inefficiency of length-restricted prefix codes
• Design and analysis of dynamic Huffman codes
• Dynamic huffman coding
• Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code
• Parity codes
• Variations on a theme by Huffman

Cited in

(4)

• scientific article; zbMATH DE number 5005895 (Why is no real title available?)
• Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code
• Parity codes
• A note on the construction of error detecting/correcting prefix codes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q441883)