Parity codes

DOI10.1051/ITA:2005015MaRDI QIDQ4680739zbMATH OpenOpenAlexFDO

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

Publication date 7 June 2005

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2005__39_1_263_0, https://eudml.org/doc/244903

zbMATH Keywords

even codeHamming-Huffman codeoptimal even codeprefix code

Mathematics Subject Classification ID

Decoding (94B35) Bounds on codes (94B65)

Recommendations

• Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code
• Exact and approximation algorithms for error-detecting even codes
• On balanced codes
• On even codes
• Parallel error correcting codes

Cites work

• 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
• Dynamic huffman coding
• 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 2176112 (Why is no real title available?)
• The WARM-UP algorithm: A Lagrangian construction of length restricted Huffman codes
• Variations on a theme by Huffman

Cited in

(4)

• Exact and approximation algorithms for error-detecting even codes
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Codes with a disparity property
• Parity encoding of binary sequences

This page was built for publication: Parity codes

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