A new approach to the covering radius of codes
Journal of Combinatorial Theory Series A
On the covering radius problem for codes II. codes of low dimension; normal and abnormal codes
SIAM Journal on Algebraic and Discrete Methods
Designs and their codes
New upper bounds for the football pool problem for 11 and 12 matches
Journal of Combinatorial Theory Series A
Graph domination, tabu search and the football pool problem
Discrete Applied Mathematics
Optimal binary linear codes of length ≤ 30
Discrete Mathematics
Constructions and families of covering codes and saturated sets of points in projective geometry
IEEE Transactions on Information Theory - Part 2
Covering radii of ternary linear codes of small dimensions and codimensions
IEEE Transactions on Information Theory
Optimal binary one-error-correcting codes of length 10 have 72 codewords
IEEE Transactions on Information Theory
Two New Four-Error-Correcting Binary Codes
Designs, Codes and Cryptography
On the binary projective codes with dimension 6
Discrete Applied Mathematics
Edge local complementation and equivalence of binary linear codes
Designs, Codes and Cryptography
Linear codes with covering radius 3
Designs, Codes and Cryptography
Directed graph representation of half-rate additive codes over GF(4)
Designs, Codes and Cryptography
Binary formally self-dual odd codes
Designs, Codes and Cryptography
| Hi-index | 0.00 |
A linear code in Fnq with dimension k and minimum distance at least d is called an [n, k, d]q code. We here consider the problem of classifying all [n, k, d]q codes given n, k, d, and q. In other words, given the Hamming space Fnq and a dimension k, we classify all k-dimensional subspaces of the Hamming space with minimum distance at least d. Our classification is an iterative procedure where equivalent codes are identified by mapping the code equivalence problem into the graph isomorphism problem, which is solved using the program nauty. For d = 3, the classification is explicitly carried out for binary codes of length n ≤ 14, ternary codes of length n ≤ 11, and quaternary codes of length n ≤ 10.