Please use this identifier to cite or link to this item:
https://doi.org/10.1109/TIT.2002.804110
| Title: | Constructions of codes from residue rings of polynomials | Authors: | Xing, C. | Keywords: | Codes Genus Polynomials |
Issue Date: | Nov-2002 | Citation: | Xing, C. (2002-11). Constructions of codes from residue rings of polynomials. IEEE Transactions on Information Theory 48 (11) : 2995-2997. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2002.804110 | Abstract: | In this correspondence, we present one construction for nonlinear codes and one construction for binary constant-weight codes based on residue rings of polynomials. It turns out that the first construction yields nonlinear codes with reasonable parameters, and a bound of Graham and Sloane is improved by the second construction. | Source Title: | IEEE Transactions on Information Theory | URI: | http://scholarbank.nus.edu.sg/handle/10635/104676 | ISSN: | 00189448 | DOI: | 10.1109/TIT.2002.804110 |
| 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.