Exact and approximation algorithms for error-detecting even codes
DOI10.1016/J.TCS.2012.03.047zbMATH Open1245.94064OpenAlexW1986921475MaRDI QIDQ441883FDOQ441883
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
Recommendations
approximation algorithmexact algorithmdata compressionHuffman codeserror detectionHamming codeseven codesprefix-free codes
Prefix, length-variable, comma-free codes (94A45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- A Method for the Construction of Minimum-Redundancy Codes
- Title not available (Why is that?)
- Bounding the inefficiency of length-restricted prefix codes
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variations on a theme by Huffman
- Bounding the Compression Loss of the FGK Algorithm
- Parity codes
- An optimum encoding with minimum longest code and total number of digits
Cited In (4)
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)
