Error-correcting codes over an alphabet of four elements

被引：56

作者：

Bogdanova, GT

Brouwer, AE

Kapralov, SN

Östergård, PRJ

机构：

[1] Bulgarian Acad Sci, Inst Math & Informat, V Tarnovo 5000, Bulgaria

[2] Eindhoven Univ Technol, Dept Math, NL-5600 MB Eindhoven, Netherlands

[3] Tech Univ, Dept Math, Gabrovo 5300, Bulgaria

[4] Helsinki Univ Technol, Dept Comp Sci & Engn, Hut 02015, Finland

来源：

DESIGNS CODES AND CRYPTOGRAPHY | 2001年 / 23卷 / 03期

基金：

芬兰科学院;

关键词：

bounds on codes; designs; error-correcting codes; nonlinear codes; quaternary codes;

D O I：

10.1023/A:1011275112159

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 [计算机软件与理论];

摘要：

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.

引用

页码：333 / 342

页数：10

共 28 条

[1]

Assmus E. F. Jr., 1972, Discrete Mathematics, V3, P1, DOI 10.1016/0012-365X(72)90021-0

[2]

Baranyai Zs., 1975, C MATH SOC JANOS BOL, V10, P91

[3]

Blake I. F., 1975, MATH THEORY CODING

[4]

Bogdanova G, 1996, P 5 INT WORKSH ALG C, P46