A generalization of cyclic code equivalence algorithm to constacyclic codes
From MaRDI portal
Publication:2692951
DOI10.1007/s10623-022-01124-1OpenAlexW3195327334WikidataQ114849601 ScholiaQ114849601MaRDI QIDQ2692951
Matthew J. Harrington, Dev Akre, Saurav R. Pandey, Nuh Aydin
Publication date: 17 March 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.08619
Uses Software
Cites Work
- Some results on the structure of constacyclic codes and new linear codes over \(\mathrm{GF}(7)\) from quasi-twisted codes
- Linear codes with complementary duals
- New binary linear codes from quasi-cyclic codes and an augmentation algorithm
- Some generalizations of the ASR search algorithm for quasitwisted codes
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
- A generalization of quasi-twisted codes: multi-twisted codes
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Is code equivalence easy to decide?
- The intractability of computing the minimum distance of a code
- Fundamentals of Error-Correcting Codes
- Error Correcting Codes in Quantum Theory
- Quantum Error Correction and Orthogonal Geometry
- Quantum codes from a class of constacyclic codes over finite commutative rings
- A class of constacyclic codes from group algebras
- Reversible codes
- The structure of 1-generator quasi-twisted codes and new linear codes
- A new algorithm for equivalence of cyclic codes and its applications
This page was built for publication: A generalization of cyclic code equivalence algorithm to constacyclic codes
