A new iterative computer search algorithm for good quasi-twisted codes
From MaRDI portal
Publication:498982
DOI10.1007/s10623-014-9950-8zbMath1360.94367OpenAlexW2024771811MaRDI QIDQ498982
Publication date: 29 September 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-014-9950-8
Related Items (5)
A database of linear codes over \(\mathbb F_{13}\) with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm ⋮ Some new quasi-twisted ternary linear codes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal ternary quasi-cyclic codes
- Improved bounds for quaternary linear codes of dimension 6.
- The Magma algebra system. I: The user language
- New minimum distance bounds for linear codes over GF(5).
- New quasi-cyclic codes over \({\mathbb F}_{5}\)
- New good rate \((m-1)/pm\) ternary and quaternary quasi-cyclic codes
- Quasi-cyclic codes over \(\mathbb F_{13}\) and enumeration of defining polynomials
- New quasi-twisted degenerate ternary linear codes
- New Quasi-Cyclic Codes From Simplex Codes
- The Geometry of Two-Weight Codes
- Nine good rate (m-1)/pm quasi-cyclic codes
- Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
- A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
- On quasi-cyclic codes with rate l m (Corresp.)
- Some (ink, k) cyclic codes in quasi-cyclic form (Corresp.)
- Six new binary quasi-cyclic codes
- Improved bounds for ternary linear codes of dimension 7
- New good quasi-cyclic ternary and quaternary linear codes
- The intractability of computing the minimum distance of a code
- New ternary quasi-cyclic codes with better minimum distances
- Some new binary, quasi-cyclic codes
- New ternary linear codes
- New optimal ternary linear codes
- Self-orthogonal quasi-cyclic codes
- Some results on quasi-cyclic codes
- Improved bounds for ternary linear codes of dimension 8 using tabu search
- The structure of 1-generator quasi-twisted codes and new linear codes
This page was built for publication: A new iterative computer search algorithm for good quasi-twisted codes
