Error-correcting codes over an alphabet of four elements
Error-correcting codes over an alphabet of four elements
复制标题
DOI：
10.1023/a:1011275112159
复制
发表时间：
2001-01-01
影响因子：
1.6
通讯作者：
Östergård, PRJ
中科院分区：
文献类型：
--
作者：
Bogdanova, GT;Brouwer, AE;Östergård, PRJ
考虑找到A(q)（n,d）的值的问题——长度为n的代码的最大大小和q个元素的字母表上的最小距离d。给出了A(4)（n,d）的上界和下界，并确定了该函数的一些值。给出了当n小于等于12时，A(4)（n,d）的已知界的表。当q小于等于M < 2q时，确定A(q)(n,d) = M的所有参数。
The problem of finding the values of A(q)(n,d)-the maximum size of a code of length n and minimum distance d over an alphabet of q elements-is considered. Upper and lower bounds on A(4)(n,d) are presented and some values of this function are settled. A table of best known bounds on A(4)(n,d) is given for n less than or equal to 12. When q less than or equal to M < 2q, all parameters for which A(q)(n,d) = M are determined.