A new algorithm for equivalence of cyclic codes and its applications
From MaRDI portal
Publication:6115441
DOI10.1007/s00200-021-00525-4arXiv2107.00159OpenAlexW3198140749MaRDI QIDQ6115441
R. Oliver Vandenberg, Nuh Aydin
Publication date: 12 July 2023
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.00159
cyclic codescyclotomic cosetsbest known linear codesequivalence of codessearch algorithms for linear codes
Related Items (2)
New binary and ternary quasi-cyclic codes with good properties ⋮ A generalization of cyclic code equivalence algorithm to constacyclic codes
Cites Work
- Unnamed Item
- Unnamed Item
- Monomial isomorphisms of cyclic codes
- Some results on the structure of constacyclic codes and new linear codes over \(\mathrm{GF}(7)\) from quasi-twisted codes
- New quinary linear codes from quasi-twisted codes and their duals
- New minimum distance bounds for linear codes over GF(5).
- LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
- New linear codes from constacyclic codes
- New binary linear codes from quasi-cyclic codes and an augmentation algorithm
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
- New quasi-twisted degenerate ternary linear codes
- Is code equivalence easy to decide?
- 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 ternary quasi-cyclic codes with better minimum distances
- The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography
- The structure of 1-generator quasi-twisted codes and new linear codes
This page was built for publication: A new algorithm for equivalence of cyclic codes and its applications
