A new algorithm for equivalence of cyclic codes and its applications
From MaRDI portal
Publication:6115441
DOI10.1007/S00200-021-00525-4arXiv2107.00159OpenAlexW3198140749MaRDI QIDQ6115441FDOQ6115441
Authors: Nuh Aydin, R. Oliver Vandenberg 
Publication date: 12 July 2023
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Abstract: Cyclic codes are among the most important families of codes in coding theory for both theoretical and practical reasons. Despite their prominence and intensive research on cyclic codes for over a half century, there are still open problems related to cyclic codes. In this work, we use recent results on the equivalence of cyclic codes to create a more efficient algorithm to partition cyclic codes by equivalence based on cyclotomic cosets. This algorithm is then implemented to carry out computer searches for both cyclic codes and quasi-cyclic (QC) codes with good parameters. We also generalize these results to repeated-root cases. We have found several new linear codes that are cyclic or QC as an application of the new approach, as well as more desirable constructions for linear codes with best known parameters. With the additional new codes obtained through standard constructions, we have found a total of 14 new linear codes.
Full work available at URL: https://arxiv.org/abs/2107.00159
Recommendations
- A generalization of cyclic code equivalence algorithm to constacyclic codes
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
- On the equivalence of cyclic and quasi-cyclic codes over finite fields
- On the equivalence of linear cyclic and constacyclic codes
- A solution of an equivalence problem for semisimple cyclic codes
cyclic codescyclotomic cosetsbest known linear codesequivalence of codessearch algorithms for linear codes
Cites Work
- LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
- The intractability of computing the minimum distance of a code
- Fundamentals of Error-Correcting Codes
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- New quinary linear codes from quasi-twisted codes and their duals
- Title not available (Why is that?)
- New quasi-twisted degenerate ternary linear codes
- New ternary quasi-cyclic codes with better minimum distances
- The structure of 1-generator quasi-twisted codes and new linear codes
- New linear codes from constacyclic codes
- New minimum distance bounds for linear codes over GF(5).
- Title not available (Why is that?)
- Monomial isomorphisms of cyclic codes
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
- Some results on the structure of constacyclic codes and new linear codes over \(\mathrm{GF}(7)\) from quasi-twisted codes
- The hardness of code equivalence over \(\mathbb F_q\) and its application to code-based cryptography
- Is code equivalence easy to decide?
- New binary linear codes from quasi-cyclic codes and an augmentation algorithm
Cited In (6)
- Novel Algebraic Structure for Cyclic Codes
- On the equivalence of linear cyclic and constacyclic codes
- A generalization of cyclic code equivalence algorithm to constacyclic codes
- A New Perspective of Cyclicity in Convolutional Codes
- New binary and ternary quasi-cyclic codes with good properties
- Title not available (Why is that?)
This page was built for publication: A new algorithm for equivalence of cyclic codes and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6115441)
