Referenced Items are not available for this document.
We give a new method in order to obtain Weil-Serre type bounds on the minimum distance of arbitrary cyclic codes over Fpe of length coprime to p, where e ges 1 is an arbitrary integer. In an earlier paper we obtained Weil-Serre type bounds for such codes only when e =1 or e =2 using lengthy explicit factorizations, which seems hopeless to generalize. The new method avoids such explicit factorizations and it produces an effective alternative. Using our method we obtain Weil-Serre type bounds in various cases. By examples we show that our bounds perform very well against Bose-Chaudhuri-Hocquenghem (BCH) bound and they yield the exact minimum distance in some cases.
Published in:
Information Theory, IEEE Transactions on
(Volume:54
,
Issue:
12
)
Date of Publication: Dec. 2008
- Page(s):
- 5381 - 5395
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 10324569
- Digital Object Identifier :
- 10.1109/TIT.2008.2006436
- Date of Current Version :
- 25 November 2008
- Issue Date :
- Dec. 2008
- 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.
