New good quasi-cyclic codes and codes with improved minimum distance

Forskningsoutput: TidskriftsbidragArtikelPeer review

32 Nedladdningar (Pure)

Sammanfattning

One of the most important and challenging problems in coding theory is to construct codes with optimal parameters. As a generalization of cyclic codes, quasi-cyclic (QC) codes as well as quasi-twisted (QT) codes have been shown to contain record-breaking codes. In this paper, various computer algorithms have been used to search for good QC codes. A lot of good new QC codes have been found and they have been used to construct new linear codes. A total 11 new codes that improve the bound on the minimum distance are presented.
OriginalspråkEngelska
Sidor (från-till)39-44
Antal sidor6
TidskriftJournal of Algebra Combinatorics Discrete Structures and Applications
Volym10
Nummer1
StatusPublicerad - 2023-jan.-04

Nationell ämneskategori

  • Datavetenskap (10201)

Fingeravtryck

Fördjupa i forskningsämnen för ”New good quasi-cyclic codes and codes with improved minimum distance”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här