Citation
Dw. Yue et Hb. Zhu, On the minimum distance of composite-length BCH codes, IEEE COMM L, 3(9), 1999, pp. 269-271
Citations number
4
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEEE COMMUNICATIONS LETTERS
ISSN journal
10897798
→ ACNP
Volume
3
Issue
9
Year of publication
1999
Pages
269 - 271
Database
ISI
SICI code
1089-7798(199909)3:9<269:OTMDOC>2.0.ZU;2-A
Abstract
In this letter, we derive a theorem which generalizes Theorem 3 in Chapter
9 of the book "The Theory of Error-Correcting Codes" by F. J. MacWilliams a
nd N. J. A, Sloane, By this theorem, we are able to give several classes of
BCH codes of composite length whose minimum distance does not exceed the B
CH bound. Moreover, we show that this theorem can also be used to determine
the true minimum distance of some other cyclic codes with composite-length
.