A novel lossless data compression scheme based on the error correcting Hamming codes

DOI10.1016/J.CAMWA.2007.11.043MaRDI QIDQ950036zbMATH OpenOpenAlexFDO

Authors Hussein Al-Bahadili

Publication date 22 October 2008

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2007.11.043

zbMATH Keywords

data compressionerror correcting Hamming codeslossless and lossy data compression

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Other types of codes (94B60)

Recommendations

• scientific article; zbMATH DE number 2135152
• Burrows-Wheeler compression: Principles and reflections
• scientific article; zbMATH DE number 3621627
• Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm
• Optimal data compression algorithm

Cites work

• A fast and efficient nearly-optimal adaptive Fano coding scheme
• A Method for the Construction of Minimum-Redundancy Codes
• A universal algorithm for sequential data compression
• Algorithm 673
• An adaptive character wordlength algorithm for data compression
• Compression of individual sequences via variable-rate coding
• Data compression
• Dynamic huffman coding
• Error detecting and error correcting codes
• scientific article; zbMATH DE number 2135152 (Why is no real title available?)

Cited in

(2)

• Application of group and expansion code in test data compression
• Error detection in arithmetic coding with artificial markers

Describes a project that uses

Uses Software

• Algorithm 673

This page was built for publication: A novel lossless data compression scheme based on the error correcting Hamming codes

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