Optimal four-dimensional codes over \(\text{GF}(8)\)
The electronic journal of combinatorics, Tome 13 (2006)
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl EuDML
We prove the nonexistence of several four-dimensional codes over GF(8) that meet the Griesmer bound. The proofs use geometric methods based on the analysis of the weight structure of subcodes. The specific parameters of the codes ruled out are: $[111,4,96],\,$ $[110,4,95],\,$ $[102,4,88],\,$ $[101,4,87],\,$ $[93,4,80],\,$ and the sequence $[29-j,4,24-j]$, for $j=0,1,2$.
Chris Jones; Angela Matney; Harold Ward. Optimal four-dimensional codes over \(\text{GF}(8)\). The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1069
@article{10_37236_1069,
author = {Chris Jones and Angela Matney and Harold Ward},
title = {Optimal four-dimensional codes over {\(\text{GF}(8)\)}},
journal = {The electronic journal of combinatorics},
year = {2006},
volume = {13},
doi = {10.37236/1069},
zbl = {1165.94328},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1069/}
}
Cité par Sources :