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

DOI10.1016/j.ipl.2007.12.008zbMath1186.68177OpenAlexW2048135010MaRDI QIDQ963391

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

data compressioninformation retrievalapproximation algorithmsprefix codes

Mathematics Subject Classification ID

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

Cites Work

• A Method for the Construction of Minimum-Redundancy Codes
• Bounding the inefficiency of length-restricted prefix codes
• Unnamed Item
• Unnamed Item

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