Classifying Subspaces of Hamming Spaces |
| |
Authors: | Patric R J Östergård |
| |
Institution: | (1) Department of Electrical and Communications Engineering, Helsinki University of Technology, P.O. Box 3000, 02015 HUT, Finland |
| |
Abstract: | A linear code in F
n
q
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 F
n
q
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. |
| |
Keywords: | automorphism group code equivalence linear code |
本文献已被 SpringerLink 等数据库收录! |
|