New good quasi-cyclic codes and codes with improved minimum distance
Eric Zhi Chen, Fredrik Jönsson
Source record
Source: Crossref
Published: Dec 13, 2022
DOI: 10.13069/jacodesmath.v10i1.234
Open original source ↗Source abstract
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. Received: 4 January 2022 | Accepted: 31 March 2022
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.