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

DOI10.1016/J.IPL.2007.12.008zbMATH Open1186.68177OpenAlexW2048135010MaRDI QIDQ963391FDOQ963391

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

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

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)

Cites Work

• Title not available (Why is that?)
• A Method for the Construction of Minimum-Redundancy Codes
• Title not available (Why is that?)
• Bounding the inefficiency of length-restricted prefix codes

Cited In (2)

• A note on r-extensible prefix codes
• Exact and approximation algorithms for error-detecting even 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)