Referenced Items are not available for this document.
The author introduces a special class of primitive BCH codes, the minimal BCH (MB) codes. It is proved that an MB code has as minimum distance its designed distance. Using the Roos bound, the author proposes a lower bound, sometimes tight, for the minimum distance of the dual of an MB code. He describes the subclass of weakly self-dual extended MB codes and then characterizes some weakly self-dual extended BCH codes. Similarly, he proves that the nontrivial extended MB code over GF(4) is the smallest extended BCH code which is not an even code. He points out that extended MB codes are principal ideals of a modular algebra
Published in:
Information Theory, IEEE Transactions on
(Volume:36
,
Issue:
1
)
Date of Publication: Jan 1990
- Page(s):
- 222 - 228
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 3652957
- Digital Object Identifier :
- 10.1109/18.50397
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Jan 1990
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
