The Nonexistence of a [207,4,165] Code over GF(5)
Designs, Codes and Cryptography
New Minimum Distance Bounds for Linear Codes over Small Fields
Problems of Information Transmission
On Optimal Codes Over the Field with Five Elements
Designs, Codes and Cryptography
Some New Results on Optimal Codes Over F5
Designs, Codes and Cryptography
A method for efficiently computing the number of codewords of fixed weights in linear codes
Discrete Applied Mathematics
On multiple caps in finite projective spaces
Designs, Codes and Cryptography
| Hi-index | 754.84 |
Let nq(k,d) be the smallest integer n for which there exists a linear code of length n, dimension k, and minimum distance d, over a field of q elements. In this correspondence we determine n5 (4,d) for all but 22 values of d