A new iterative computer search algorithm for good quasi-twisted codes

DOI10.1007/S10623-014-9950-8zbMATH Open1360.94367OpenAlexW2024771811MaRDI QIDQ498982FDOQ498982

Eric Z. Chen

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

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

zbMATH Keywords

linear codesquasi-twisted codesbest-known codescoding theorysearch algorithmsimplex code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Cites Work

• The Magma algebra system. I: The user language
• The Geometry of Two-Weight Codes
• The intractability of computing the minimum distance of a code
• New quasi-cyclic codes over \({\mathbb F}_{5}\)
• New quasi-twisted degenerate ternary linear codes
• New Quasi-Cyclic Codes From Simplex Codes
• Nine good rate (m-1)/pm quasi-cyclic codes
• On quasi-cyclic codes with rate l m (Corresp.)
• Six new binary quasi-cyclic codes
• New good quasi-cyclic ternary and quaternary linear codes
• New ternary quasi-cyclic codes with better minimum distances
• Title not available (Why is that?)
• Some new binary, quasi-cyclic codes
• Some results on quasi-cyclic codes
• The structure of 1-generator quasi-twisted codes and new linear codes
• Optimal ternary quasi-cyclic codes
• Quasi-cyclic codes over \(\mathbb F_{13}\) and enumeration of defining polynomials
• Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
• Improved bounds for ternary linear codes of dimension 7
• New ternary linear codes
• A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
• Improved bounds for quaternary linear codes of dimension 6.
• New minimum distance bounds for linear codes over GF(5).
• New good rate \((m-1)/pm\) ternary and quaternary quasi-cyclic codes
• Title not available (Why is that?)
• Some (ink, k) cyclic codes in quasi-cyclic form (Corresp.)
• New optimal ternary linear codes
• Self-orthogonal quasi-cyclic codes
• Improved bounds for ternary linear codes of dimension 8 using tabu search

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

Uses Software

• Magma

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)