On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
From MaRDI portal
Publication:2324762
DOI10.1007/s10623-019-00613-0zbMath1419.94061OpenAlexW2914757902WikidataQ128448942 ScholiaQ128448942MaRDI QIDQ2324762
Jonathan Lambrinos, Oliver VandenBerg, Nuh Aydin
Publication date: 12 September 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-019-00613-0
cyclic codesconstacyclic codesquasi-twisted codesbest known linear codesequivalence of codessearch algorithms for linear codes
Related Items (10)
Polycyclic codes associated with trinomials: good codes and open questions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An updated database of \(\mathbb{Z}_4\) codes and an open problem about quasi-cyclic codes ⋮ On the equivalence of linear cyclic and constacyclic codes ⋮ A new algorithm for equivalence of cyclic codes and its applications ⋮ Good classical and quantum codes from multi-twisted codes ⋮ New binary and ternary quasi-cyclic codes with good properties ⋮ A generalization of cyclic code equivalence algorithm to constacyclic codes ⋮ Some generalizations of the ASR search algorithm for quasitwisted codes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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).
- New linear codes from constacyclic codes
- New binary linear codes from quasi-cyclic codes and an augmentation algorithm
- Multipliers and generalized multipliers of cyclic objects and cyclic codes
- New quasi-cyclic codes over \({\mathbb F}_{5}\)
- New good rate \((m-1)/pm\) ternary and quaternary quasi-cyclic codes
- The equivalence of two cyclic objects on \(pq\) elements
- New quasi-twisted quaternary linear codes
- A solution of an equivalence problem for semisimple cyclic codes
- New quasi-twisted degenerate ternary linear codes
- New binary one-generator quasi-cyclic codes
- Duadic Codes
- Inequivalent cyclic codes of prime length (Corresp.)
- Six new binary quasi-cyclic 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: On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
