Quasi-cyclic codes over \(\mathbb F_{13}\) and enumeration of defining polynomials
From MaRDI portal
Publication:1932370
DOI10.1016/j.jda.2012.04.006zbMath1275.94044OpenAlexW2004251193MaRDI QIDQ1932370
T. Aaron Gulliver, V. Ch. Venkaiah
Publication date: 18 January 2013
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.04.006
Related Items
Unnamed Item, A database of linear codes over \(\mathbb F_{13}\) with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm, Unnamed Item, Unnamed Item, A new iterative computer search algorithm for good quasi-twisted codes, A new \((37, 3)\)-arc in \(\mathrm{PG}(2,23)\)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Almost MDS codes
- On minimum weight codewords in QR codes
- Optimal ternary quasi-cyclic codes
- On self-dual codes over some prime fields.
- New good rate \((m-1)/pm\) ternary and quaternary quasi-cyclic codes
- Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
- Tabu Search—Part I
- New good quasi-cyclic ternary and quaternary linear codes
- New optimal ternary linear codes