Parity codes

DOI10.1051/ita:2005015zbMath1086.94036OpenAlexW4239126445MaRDI QIDQ4680739

Fábio Protti, Paulo Eustáquio Duarte Pinto, Jayme Luiz 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

zbMATH Keywords

prefix codeeven codeHamming-Huffman codeoptimal even code

Mathematics Subject Classification ID

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

Related Items (1)

Exact and approximation algorithms for error-detecting even codes

Cites Work

• The WARM-UP Algorithm: A Lagrangian Construction of Length Restricted Huffman Codes
• A fast algorithm for optimal length-limited Huffman codes
• Dynamic huffman coding
• Variations on a theme by Huffman
• Bounding the Compression Loss of the FGK Algorithm
• An optimum encoding with minimum longest code and total number of digits
• Bounding the inefficiency of length-restricted prefix codes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parity codes