Seven new champion linear codes
journal contributionposted on 2013-06-26, 10:59 authored 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.
- Mathematical Sciences
CitationBROWN, G. and KASPRZYK, A.M., 2013. Seven new champion linear codes. LMS Journal of Computation and Mathematics, 16, pp. 109 - 117.
PublisherCambridge Journals Online; London Mathematical Society © The Author(s)
- VoR (Version of Record)
NotesThis article was published in the LMS Journal of Computation and Mathematics [© The Author(s)].