Indexed metadata
Generating generalized necklaces and new quasi-cyclic codes
Rumen Daskalov, Elena Metodieva
Source record
Source: Crossref
Published: Sep 6, 2020
DOI: 10.13069/jacodesmath.784999
Open original source ↗Source abstract
In many cases there is a need of exhaustive lists of combinatorial objects of a given type. We consider generation of all inequivalent polynomials from which defining polynomials for constructing quasi-cyclic (QC) codes are to be chosen. Using these defining polynomials we construct 34 new good QC codes over GF(11) and 36 such codes over GF(13). Received: 23 May 2019 | Accepted: 25 March 2020
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.