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

共 50 条

[31] Minimum distance of linear codes and the α-invariant
Garrousian, Mehdi
Tohaneanu, Stefan O.
ADVANCES IN APPLIED MATHEMATICS, 2015, 71 : 190 - 207
[32] On computing the minimum distance of linear codes
Mohri, M
Morii, M
ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 2000, 83 (11): : 32 - 42
[33] New linear codes of dimensions 5 and 6 over GF(8)
Gulliver, TA
ARS COMBINATORIA, 2002, 65 : 91 - 96
[34] BOUNDS ON THE MINIMUM DISTANCE OF THE DUALS OF EXTENDED BCH CODES OVER F-P
LEVYDITVEHEL, F
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 1995, 6 (03) : 175 - 190
[35] MINIMUM DISTANCE BOUNDS FOR CYCLIC CODES AND DELIGNES THEOREM
MORENO, O
KUMAR, PV
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (05) : 1524 - 1534
[36] UPPER BOUNDS ON THE MINIMUM DISTANCE OF TRELLIS CODES.
Calderbank, A.R.
Mazo, J.E.
Shapiro, H.M.
The Bell System technical journal, 1983, 62 (8 pt 1): : 2617 - 2646
[37] Minimum distance bounds for s-regular codes
Martin, WJ
DESIGNS CODES AND CRYPTOGRAPHY, 2000, 21 (1-3) : 181 - 187
[38] Minimum Distance Bounds for s-Regular Codes
William J. Martin
Designs, Codes and Cryptography, 2000, 21 : 181 - 187
[39] Lower bounds on the minimum average distance of binary codes
Mounits, Beniamin
DISCRETE MATHEMATICS, 2008, 308 (24) : 6241 - 6253
[40] Upper and Lower Bounds on the Minimum Distance of Expander Codes
Frolov, Alexey
Zyablov, Victor
2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 1397 - 1401

← 1 2 3 4 5 →