A novel lossless data compression scheme based on the error correcting Hamming codes
From MaRDI portal
Publication:950036
DOI10.1016/j.camwa.2007.11.043zbMath1145.68410OpenAlexW2038839959MaRDI QIDQ950036
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
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Other types of codes (94B60)
Related Items
Uses Software
Cites Work
- Unnamed Item
- An adaptive character wordlength algorithm for data compression
- A fast and efficient nearly-optimal adaptive Fano coding scheme
- Dynamic huffman coding
- Data compression
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Algorithm 673
- Error Detecting and Error Correcting Codes
- A Method for the Construction of Minimum-Redundancy Codes