Brown and Kasprzyk-codes.pdf (312.92 kB)
0/0

Seven new champion linear codes

Download (312.92 kB)
journal contribution
posted on 26.06.2013 by Gavin Brown, Alexander M. Kasprzyk
We exhibit seven linear codes exceeding the current best known minimum distance d for their dimension k and block length n . Each code is defined over F 8 , and their invariants [n,k,d] are given by [49,13,27] , [49,14,26] , [49,16,24] , [49,17,23] , [49,19,21] , [49,25,16] and [49,26,15] . Our method includes an exhaustive search of all monomial evaluation codes generated by points in the [0,5]×[0,5] lattice square.

History

School

  • Science

Department

  • Mathematical Sciences

Citation

BROWN, G. and KASPRZYK, A.M., 2013. Seven new champion linear codes. LMS Journal of Computation and Mathematics, 16, pp. 109 - 117.

Publisher

Cambridge Journals Online; London Mathematical Society © The Author(s)

Version

VoR (Version of Record)

Publication date

2013

Notes

This article was published in the LMS Journal of Computation and Mathematics [© The Author(s)].

ISSN

1461-1570

Language

en

Exports

Logo branding

Keyword(s)

Exports