Some new binary codes with improved minimum distances

Forskningsoutput: TidskriftsbidragArtikelPeer review

1 Citeringar (Scopus)

Sammanfattning

It has been well-known that the class of quasi-cyclic (QC) codes contain many good codes. In thispaper, a method to conduct a computer search for binary 2-generator QC codes is presented, anda large number of good 2-generator QC codes have been obtained. 5 new binary QC codes thatimprove the lower bounds on minimum distance are presented. Furthermore, with new 2-generatorQC codes and Construction X, 2 new improved binary linear codes are obtained. With the standardconstruction techniques, another 16 new binary linear codes that improve the lower bound on theminimum distance have also been obtained.

OriginalspråkEngelska
Sidor (från-till)65-70
Antal sidor5
TidskriftJournal of Algebra Combinatorics Discrete Structures and Applications
Volym5
Utgåva2
DOI
StatusPublicerad - 2018

Nationell ämneskategori

  • Elektroteknik och elektronik (202)

Fingeravtryck

Fördjupa i forskningsämnen för ”Some new binary codes with improved minimum distances”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här