Please use this identifier to cite or link to this item:
https://doi.org/10.1109/TIT.2002.802593
| Title: | The minimum distance of the duals of binary irreducible cyclic codes | Authors: | Ding, C. Helleseth, T. Niederreiter, H. Xing, C. |
Keywords: | Codes Cyclotomy Irreducible cyclic codes |
Issue Date: | Oct-2002 | Citation: | Ding, C., Helleseth, T., Niederreiter, H., Xing, C. (2002-10). The minimum distance of the duals of binary irreducible cyclic codes. IEEE Transactions on Information Theory 48 (10) : 2679-2689. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2002.802593 | Abstract: | Irreducible cyclic codes have been an interesting subject of study for many years. The weight distribution of some of them have been determined. In this paper, we determine the minimum distance and certain weights of the duals of binary irreducible cyclic codes. We show that the weight distribution of these codes is determined by the cyclotomic numbers of certain order. As a byproduct, we describe a class of double-error correcting codes. | Source Title: | IEEE Transactions on Information Theory | URI: | http://scholarbank.nus.edu.sg/handle/10635/104318 | ISSN: | 00189448 | DOI: | 10.1109/TIT.2002.802593 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.