IEICE TRANSACTIONS on Information
Burst Error Recovery for Huffman Coding
Summary :
Although data compression is popularly used, compressed data have a problem that they are very sensitive to errors. This paper proposes a single burst error recovery method for Huffman coding by using the bidirectionally decodable Huffman coding. Computer simulation shows that the proposed method can recover 2.5lburst bits burst error with high probability, where lburst is the maximum length of burst errors which the proposed method is expected to be able to recover.
- Publication
- IEICE TRANSACTIONS on Information Vol.E88-D No.9 pp.2197-2200
- Publication Date
- 2005/09/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietisy/e88-d.9.2197
- Type of Manuscript
- LETTER
- Category
- Algorithm Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Masato KITAKAMI, Satoshi NAKAMURA, "Burst Error Recovery for Huffman Coding" in IEICE TRANSACTIONS on Information,
vol. E88-D, no. 9, pp. 2197-2200, September 2005, doi: 10.1093/ietisy/e88-d.9.2197.
Abstract: Although data compression is popularly used, compressed data have a problem that they are very sensitive to errors. This paper proposes a single burst error recovery method for Huffman coding by using the bidirectionally decodable Huffman coding. Computer simulation shows that the proposed method can recover 2.5lburst bits burst error with high probability, where lburst is the maximum length of burst errors which the proposed method is expected to be able to recover.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e88-d.9.2197/_p
Copy
@ARTICLE{e88-d_9_2197,
author={Masato KITAKAMI, Satoshi NAKAMURA, },
journal={IEICE TRANSACTIONS on Information},
title={Burst Error Recovery for Huffman Coding},
year={2005},
volume={E88-D},
number={9},
pages={2197-2200},
abstract={Although data compression is popularly used, compressed data have a problem that they are very sensitive to errors. This paper proposes a single burst error recovery method for Huffman coding by using the bidirectionally decodable Huffman coding. Computer simulation shows that the proposed method can recover 2.5lburst bits burst error with high probability, where lburst is the maximum length of burst errors which the proposed method is expected to be able to recover.},
keywords={},
doi={10.1093/ietisy/e88-d.9.2197},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - Burst Error Recovery for Huffman Coding
T2 - IEICE TRANSACTIONS on Information
SP - 2197
EP - 2200
AU - Masato KITAKAMI
AU - Satoshi NAKAMURA
PY - 2005
DO - 10.1093/ietisy/e88-d.9.2197
JO - IEICE TRANSACTIONS on Information
SN -
VL - E88-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2005
AB - Although data compression is popularly used, compressed data have a problem that they are very sensitive to errors. This paper proposes a single burst error recovery method for Huffman coding by using the bidirectionally decodable Huffman coding. Computer simulation shows that the proposed method can recover 2.5lburst bits burst error with high probability, where lburst is the maximum length of burst errors which the proposed method is expected to be able to recover.
ER -
English
