A note on the construction of error detecting/correcting prefix codes

DOI10.1016/J.IPL.2007.12.008MaRDI QIDQ963391zbMATH OpenOpenAlexFDO

Authors Artur Alves Pessoa

Publication date 19 April 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.12.008

zbMATH Keywords

approximation algorithmsdata compressioninformation retrievalprefix codes

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Approximation algorithms (68W25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Exact and approximation algorithms for error-detecting even codes
• Fast and Compact Prefix Codes
• Optimum extensions of prefix codes.
• Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code
• scientific article; zbMATH DE number 1543071

Cites work

• scientific article; zbMATH DE number 3672160 (Why is no real title available?)
• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• Bounding the inefficiency of length-restricted prefix codes

Cited in

(2)

• Exact and approximation algorithms for error-detecting even codes
• A note on r-extensible prefix codes

This page was built for publication: A note on the construction of error detecting/correcting prefix codes

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