Name
Abstract | ||
|---|---|---|
Hermitian self-dual quaternary codes exist for all even lengths. The smallest length for which the maximum possible minimum distance of such codes is undetermined is 26; it is then either 8 or 10. By exhaustive computer search this case is settled; it is shown that minimum distance 10 is impossible for these parameters. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/TIT.2004.838349 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
dual codes,linear codes,telecommunication computing,Hermitian self-dual quaternary code,computer search,linear codes,65,Quaternary codes,self-dual codes | Discrete mathematics,Combinatorics,Existential quantification,Algebra,Hermite polynomials,Coding (social sciences),Linear code,Computer search,Hermitian matrix,Telecommunication computing,Mathematics | Journal |
Volume | Issue | ISSN |
50 | 12 | 0018-9448 |
Citations | PageRank | References |
2 | 0.40 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Patric R. J. Östergård | 1 | 92 | 12.09 |