On the equivalence of cyclic and quasi-cyclic codes over finite fields
From MaRDI portal
Publication:5241158
zbMATH Open1423.94148MaRDI QIDQ5241158FDOQ5241158
Authors: Kenza Guenda, T. Aaron Gulliver 
Publication date: 30 October 2019
Recommendations
- Inequivalent cyclic codes of prime length (Corresp.)
- A solution of an equivalence problem for semisimple cyclic codes
- On the equivalence of codes and codes with an automorphism having two cycles
- Notes on quasi-cyclic codes with cyclic constituent codes
- On the equivalence of linear cyclic and constacyclic codes
Cites Work
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- On the Algebraic Structure of Quasi-Cyclic Codes III: Generator Theory
- Isomorphism of circulant graphs and digraphs
- Isomorphism problem for relational structures with a cyclic automorphism
- Polynomial isomorphisms of combinatorial objects
- Multipliers and generalized multipliers of cyclic objects and cyclic codes
- On the permutation groups of cyclic codes
- Title not available (Why is that?)
- The hardness of code equivalence over \(\mathbb F_q\) and its application to code-based cryptography
Cited In (13)
- Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
- On the equivalence of linear cyclic and constacyclic codes
- A new algorithm for equivalence of cyclic codes and its applications
- On the nonperiodic cyclic equivalence classes of Reed-Solomon codes
- A solution of an equivalence problem for semisimple cyclic codes
- A generalization of cyclic code equivalence algorithm to constacyclic codes
- Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes. I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the nonperiodic cyclic equivalance classes of Hamming codes and BCH codes
- Title not available (Why is that?)
Uses Software
This page was built for publication: On the equivalence of cyclic and quasi-cyclic codes over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241158)
