For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
On Relationship between the Boston Bound and Well-Known Bounds for Cyclic Codes
Junru ZHENG Takayasu KAIDA
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2009/10/01
Online ISSN: 1745-1337
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Boston bound, cyclic code, defining set, BCH bound, Hartmann-Tzeng bound, minimum distance,
Full Text: PDF(72.3KB)>>
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.