A Mixed Upper Bound on the Maximum Size of Codes for Multiple Burst Error Correction and Detection
Summary :
We derive an upper bound on the size of a block code with prescribed burst-error-correcting capability combining those two ideas underlying the generalized Singleton and sphere-packing bounds. The two ideas are puncturing and sphere-packing. We use the burst metric defined by Gabidulin, which is suitable for burst error correction and detection. It is demonstrated that the proposed bound improves previously known ones for finite code-length, when minimum distance is greater than 3, as well as in the asymptotic forms.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.10 pp.1964-1971
- Publication Date
- 1998/10/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Coding 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
Mitsuru HAMADA, "A Mixed Upper Bound on the Maximum Size of Codes for Multiple Burst Error Correction and Detection" in IEICE TRANSACTIONS on Fundamentals,
vol. E81-A, no. 10, pp. 1964-1971, October 1998, doi: .
Abstract: We derive an upper bound on the size of a block code with prescribed burst-error-correcting capability combining those two ideas underlying the generalized Singleton and sphere-packing bounds. The two ideas are puncturing and sphere-packing. We use the burst metric defined by Gabidulin, which is suitable for burst error correction and detection. It is demonstrated that the proposed bound improves previously known ones for finite code-length, when minimum distance is greater than 3, as well as in the asymptotic forms.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_10_1964/_p
Copy
@ARTICLE{e81-a_10_1964,
author={Mitsuru HAMADA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Mixed Upper Bound on the Maximum Size of Codes for Multiple Burst Error Correction and Detection},
year={1998},
volume={E81-A},
number={10},
pages={1964-1971},
abstract={We derive an upper bound on the size of a block code with prescribed burst-error-correcting capability combining those two ideas underlying the generalized Singleton and sphere-packing bounds. The two ideas are puncturing and sphere-packing. We use the burst metric defined by Gabidulin, which is suitable for burst error correction and detection. It is demonstrated that the proposed bound improves previously known ones for finite code-length, when minimum distance is greater than 3, as well as in the asymptotic forms.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - A Mixed Upper Bound on the Maximum Size of Codes for Multiple Burst Error Correction and Detection
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1964
EP - 1971
AU - Mitsuru HAMADA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1998
AB - We derive an upper bound on the size of a block code with prescribed burst-error-correcting capability combining those two ideas underlying the generalized Singleton and sphere-packing bounds. The two ideas are puncturing and sphere-packing. We use the burst metric defined by Gabidulin, which is suitable for burst error correction and detection. It is demonstrated that the proposed bound improves previously known ones for finite code-length, when minimum distance is greater than 3, as well as in the asymptotic forms.
ER -
English
