New linear codes over non-prime fields
From MaRDI portal
Publication:2325292
DOI10.1007/s12095-018-0333-2zbMath1419.94060OpenAlexW2895191681MaRDI QIDQ2325292
Jonathan Lambrinos, Ghada Bakbouk, Nuh Aydin
Publication date: 25 September 2019
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://digital.kenyon.edu/cgi/viewcontent.cgi?article=1057&context=summerscienceprogram
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- New quasi-cyclic codes over \({\mathbb F}_{5}\)
- New good rate \((m-1)/pm\) ternary and quaternary quasi-cyclic codes
- New minimum distance bounds for linear codes over \(GF\)(9)
- New quasi-cyclic degenerate linear codes over GF(8)
- New quasi-twisted quaternary 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
- Fundamentals of Error-Correcting Codes
- New ternary quasi-cyclic codes with better minimum distances
- The structure of 1-generator quasi-twisted codes and new linear codes
This page was built for publication: New linear codes over non-prime fields
