IEICE TRANSACTIONS on Fundamentals
On Relationship between the Boston Bound and Well-Known Bounds for Cyclic Codes
Summary :
For a cyclic code, the BCH Bound and the Hartmann-Tzeng bound are two of well-known lower bounds for its minimum distance. New bounds are proposed by N. Boston in 2001, that depend on defining set of cyclic code. In this paper, we consider the between the Boston bound and these two bounds for non-binary cyclic codes from numerical examples.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E92-A No.10 pp.2484-2486
- Publication Date
- 2009/10/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E92.A.2484
- Type of Manuscript
- Special Section LETTER (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
Junru ZHENG, Takayasu KAIDA, "On Relationship between the Boston Bound and Well-Known Bounds for Cyclic Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 10, pp. 2484-2486, October 2009, doi: 10.1587/transfun.E92.A.2484.
Abstract: For a cyclic code, the BCH Bound and the Hartmann-Tzeng bound are two of well-known lower bounds for its minimum distance. New bounds are proposed by N. Boston in 2001, that depend on defining set of cyclic code. In this paper, we consider the between the Boston bound and these two bounds for non-binary cyclic codes from numerical examples.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.2484/_p
Copy
@ARTICLE{e92-a_10_2484,
author={Junru ZHENG, Takayasu KAIDA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Relationship between the Boston Bound and Well-Known Bounds for Cyclic Codes},
year={2009},
volume={E92-A},
number={10},
pages={2484-2486},
abstract={For a cyclic code, the BCH Bound and the Hartmann-Tzeng bound are two of well-known lower bounds for its minimum distance. New bounds are proposed by N. Boston in 2001, that depend on defining set of cyclic code. In this paper, we consider the between the Boston bound and these two bounds for non-binary cyclic codes from numerical examples.},
keywords={},
doi={10.1587/transfun.E92.A.2484},
ISSN={1745-1337},
month={October},}
Copy
TY - JOUR
TI - On Relationship between the Boston Bound and Well-Known Bounds for Cyclic Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2484
EP - 2486
AU - Junru ZHENG
AU - Takayasu KAIDA
PY - 2009
DO - 10.1587/transfun.E92.A.2484
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2009
AB - For a cyclic code, the BCH Bound and the Hartmann-Tzeng bound are two of well-known lower bounds for its minimum distance. New bounds are proposed by N. Boston in 2001, that depend on defining set of cyclic code. In this paper, we consider the between the Boston bound and these two bounds for non-binary cyclic codes from numerical examples.
ER -
English
