A new iterative computer search algorithm for good quasi-twisted codes
From MaRDI portal
Recommendations
- Some generalizations of the ASR search algorithm for quasitwisted codes
- New linear codes over non-prime fields
- New quinary linear codes from quasi-twisted codes and their duals
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
- Some new binary, quasi-cyclic codes
Cites work
- scientific article; zbMATH DE number 6488188 (Why is no real title available?)
- scientific article; zbMATH DE number 1792627 (Why is no real title available?)
- A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
- Improved bounds for quaternary linear codes of dimension 6.
- Improved bounds for ternary linear codes of dimension 7
- Improved bounds for ternary linear codes of dimension 8 using tabu search
- New Quasi-Cyclic Codes From Simplex Codes
- New good quasi-cyclic ternary and quaternary linear codes
- New good rate (m-1)/pm ternary and quaternary quasi-cyclic codes
- New minimum distance bounds for linear codes over GF(5).
- New optimal ternary linear codes
- New quasi-cyclic codes over \({\mathbb F}_{5}\)
- New quasi-twisted degenerate ternary linear codes
- New ternary linear codes
- New ternary quasi-cyclic codes with better minimum distances
- Nine good rate (m-1)/pm quasi-cyclic codes
- On quasi-cyclic codes with rate l m (Corresp.)
- Optimal ternary quasi-cyclic codes
- Quasi-cyclic codes over \(\mathbb F_{13}\) and enumeration of defining polynomials
- Self-orthogonal quasi-cyclic codes
- Six new binary quasi-cyclic codes
- Some (ink, k) cyclic codes in quasi-cyclic form (Corresp.)
- Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
- Some new binary, quasi-cyclic codes
- Some results on quasi-cyclic codes
- The Geometry of Two-Weight Codes
- The Magma algebra system. I: The user language
- The intractability of computing the minimum distance of a code
- The structure of 1-generator quasi-twisted codes and new linear codes
Cited in
(6)- Some new binary codes with improved minimum distances
- 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
- Some new ternary linear codes
- Generating generalized necklaces and new quasi-cyclic codes
- Some generalizations of the ASR search algorithm for quasitwisted codes
This page was built for publication: A new iterative computer search algorithm for good quasi-twisted codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498982)
