Codes for Compression and Error Detection
Resumo
This article summarizes the main results about codes that combine the data compression power of Huffman trees with the error detection mechanisms proposed by Hamming. Two methods are described: the even trees method and the Hamming-Huffman trees method. Most of the works are the result of a close collaboration with Jayme Luiz Szwarcfiter.
Texto completo:
PDFDOI: https://doi.org/10.12957/cadinf.2022.70590
Apontamentos
- Não há apontamentos.
ISSN: 1413-9014 / E-ISSN: 2317-2193
DOI: dx.doi.org/10.12957/cadinf
This work is licensed under a Creative Commons Attribution 4.0 International License