Bounds on minimum distance for linear codes over GF(5)

被引：8

作者：

Daskalov, RN ^{[1
]}

Gulliver, TA

机构：

[1] Tech Univ, Dept Math, BG-5300 Gabrovo, Bulgaria

[2] Univ Canberra, Dept Elect & Elect Engn, Christchurch, New Zealand

来源：

APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING | 1999年 / 9卷 / 06期

关键词：

quasi-cyclic codes; linear codes over GF(5);

D O I：

10.1007/s002000050117

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Let [n, k, d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF(q), Let d(5)(n, k) be the maximum possible minimum Hamming distance of a linear [n, k, d; 5]-code for given values of n and k. In this paper, forty four new linear codes over GF(5) are constructed and a table of d5 (n, k) k less than or equal to 8, n less than or equal to 100 is presented.

引用

页码：547 / 558

页数：12