Some generalizations of the ASR search algorithm for quasitwisted codes
From MaRDI portal
Publication:2299419
DOI10.2140/involve.2020.13.137zbMath1431.94177OpenAlexW3005390700MaRDI QIDQ2299419
Peihan Liu, Thomas H. Guidotti, Robert O. VandenBerg, Armiya S. Shaikh, Nuh Aydin
Publication date: 21 February 2020
Published in: Involve (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/involve.2020.13.137
Related Items (4)
An updated database of \(\mathbb{Z}_4\) codes and an open problem about quasi-cyclic codes ⋮ 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
Cites Work
- Unnamed Item
- On double cyclic codes over \(\mathbb{Z}_4\)
- New minimum distance bounds for linear codes over GF(5).
- New quasi-cyclic codes over \({\mathbb F}_{5}\)
- 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
- \(\mathbb Z_2\)-double cyclic codes
- New quasi-twisted quaternary linear codes
- New quasi-twisted degenerate ternary linear codes
- New binary one-generator quasi-cyclic codes
- Six new binary quasi-cyclic codes
- The intractability of computing the minimum distance of a code
- The structure of 1-generator quasi-twisted codes and new linear codes
This page was built for publication: Some generalizations of the ASR search algorithm for quasitwisted codes