Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code

DOI10.1007/978-3-642-02017-9_34MaRDI QIDQ3630217zbMATH OpenOpenAlexFDO

Authors Fábio Protti, Paulo E. D. Pinto, Jayme L. Szwarcfiter

Publication date 3 June 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11422/1924

zbMATH Keywords

data compressionerror detectioneven codesHamming codesHuffman 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)

Recommendations

• Exact and approximation algorithms for error-detecting even codes
• A fast algorithm for optimal length-limited Huffman codes
• Tight Bounds on the Redundancy of Huffman Codes\hbox{ H }\hbox{ H }
• Tight bounds on the redundancy of Huffman codes
• Tight upper bounds on the redundancy of Huffman codes
• Almost-MDS and near-MDS codes for error detection
• New bounds on the redundancy of Huffman codes
• A novel memory-efficient Huffman decoding algorithm and its implementation
• An efficient decoding technique for Huffman codes

Cited in

(4)

• An application of the Hopfield model to Huffman codes
• Exact and approximation algorithms for error-detecting even codes
• Parity codes
• A note on the construction of error detecting/correcting prefix codes

This page was built for publication: Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code

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