Constructions of codes from residue rings of polynomials

被引：10

作者：

Xing, CP ^{[1
]}

机构：

[1] Natl Univ Singapore, Dept Math, Singapore 117543, Singapore

[2] Univ Sci & Technol China, Dept Math, Hefei 230026, Anhua, Peoples R China

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2002年 / 48卷 / 11期

关键词：

codes; genus; polynomials;

D O I：

10.1109/TIT.2002.804110

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：2995 / 2997

页数：3