New binary linear codes from quasi-cyclic codes and an augmentation algorithm
From MaRDI portal
Publication:1675490
DOI10.1007/S00200-017-0327-XzbMATH Open1375.94168OpenAlexW2616450673MaRDI QIDQ1675490FDOQ1675490
Authors: Nuh Aydin, Nicholas Connolly, John M. Murphree 
Publication date: 27 October 2017
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-017-0327-x
Recommendations
Cites Work
- The intractability of computing the minimum distance of a code
- New quinary linear codes from quasi-twisted codes and their duals
- New quasi-cyclic codes over \({\mathbb F}_{5}\)
- New binary \(h\)-generator quasi-cyclic codes by augmentation and new minimum distance bounds
- New quasi-twisted degenerate ternary linear codes
- Six new binary quasi-cyclic codes
- New ternary quasi-cyclic codes with better minimum distances
- The structure of 1-generator quasi-twisted codes and new linear codes
- New linear codes from constacyclic codes
- New binary one-generator quasi-cyclic codes
- New minimum distance bounds for linear codes over GF(5).
- New good rate \((m-1)/pm\) ternary and quaternary quasi-cyclic codes
Cited In (15)
- New linear codes over non-prime fields
- New linear codes over \(\mathrm{GF}(3)\), \(\mathrm{GF}(11)\), and \(\mathrm{GF}(13)\)
- Multi-twisted codes over finite fields and their dual codes
- New binary \(h\)-generator quasi-cyclic codes by augmentation and new minimum distance bounds
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
- \(\mathbb{Z}_q(\mathbb{Z}_q+u\mathbb{Z}_q)\)-linear skew constacyclic codes
- Skew cyclic codes over \(\mathbb{Z}_4+u \mathbb{Z}_4+v \mathbb{Z}_4\)
- A new algorithm for equivalence of cyclic codes and its applications
- Good classical and quantum codes from multi-twisted codes
- Title not available (Why is that?)
- A generalization of cyclic code equivalence algorithm to constacyclic codes
- Skew multi-twisted codes over finite fields and their Galois duals
- Half-cyclic, dihedral and half-dihedral codes
- Generating generalized necklaces and new quasi-cyclic codes
- New binary and ternary quasi-cyclic codes with good properties
Uses Software
This page was built for publication: New binary linear codes from quasi-cyclic codes and an augmentation algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675490)
