IEICE TRANSACTIONS on Fundamentals
Asymptotic Bounds for Unidirectional Byte Error-Correcting Codes
Summary :
Asymptotic bounds are considered for unidirectional byte error-correcting codes. Upper bounds are developed from the concepts of the Singleton, Plotkin, and Hamming bounds. Lower bounds are also derived from a combination of the generalized concatenated code construction and the Varshamov-Gilbert bound. As the result, we find that there exist codes of low rate better than those on the basis of Hamming distance with respect to unidirectional byte error-correction.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E76-A No.9 pp.1437-1441
- Publication Date
- 1993/09/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
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
Yuichi SAITOH, Hideki IMAI, "Asymptotic Bounds for Unidirectional Byte Error-Correcting Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E76-A, no. 9, pp. 1437-1441, September 1993, doi: .
Abstract: Asymptotic bounds are considered for unidirectional byte error-correcting codes. Upper bounds are developed from the concepts of the Singleton, Plotkin, and Hamming bounds. Lower bounds are also derived from a combination of the generalized concatenated code construction and the Varshamov-Gilbert bound. As the result, we find that there exist codes of low rate better than those on the basis of Hamming distance with respect to unidirectional byte error-correction.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e76-a_9_1437/_p
Copy
@ARTICLE{e76-a_9_1437,
author={Yuichi SAITOH, Hideki IMAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Asymptotic Bounds for Unidirectional Byte Error-Correcting Codes},
year={1993},
volume={E76-A},
number={9},
pages={1437-1441},
abstract={Asymptotic bounds are considered for unidirectional byte error-correcting codes. Upper bounds are developed from the concepts of the Singleton, Plotkin, and Hamming bounds. Lower bounds are also derived from a combination of the generalized concatenated code construction and the Varshamov-Gilbert bound. As the result, we find that there exist codes of low rate better than those on the basis of Hamming distance with respect to unidirectional byte error-correction.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - Asymptotic Bounds for Unidirectional Byte Error-Correcting Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1437
EP - 1441
AU - Yuichi SAITOH
AU - Hideki IMAI
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E76-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 1993
AB - Asymptotic bounds are considered for unidirectional byte error-correcting codes. Upper bounds are developed from the concepts of the Singleton, Plotkin, and Hamming bounds. Lower bounds are also derived from a combination of the generalized concatenated code construction and the Varshamov-Gilbert bound. As the result, we find that there exist codes of low rate better than those on the basis of Hamming distance with respect to unidirectional byte error-correction.
ER -
English
