A new iterative computer search algorithm for good quasi-twisted codes
type: Item
instance of: scholarly article
title: A new iterative computer search algorithm for good quasi-twisted codes
zbMATH Open document ID: 1360.94367
author: Eric Z. Chen
published in: Designs, Codes and Cryptography
publication date: 2015-09-29T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 94B15
zbMATH DE Number: 6486875
zbMATH Keywords: best-known codes
zbMATH Keywords: coding theory
zbMATH Keywords: search algorithm
zbMATH Keywords: linear codes
zbMATH Keywords: quasi-twisted codes
zbMATH Keywords: simplex code
describes a project that uses: Magma
MaRDI profile type: Publication
full work available at URL: s10623-014-9950-8
OpenAlex ID: W2024771811
cites work: New quasi-cyclic codes over \({\mathbb F}_{5}\)
cites work: The structure of 1-generator quasi-twisted codes and new linear codes
cites work: Q2949568
cites work: Some (ink, k) cyclic codes in quasi-cyclic form (Corresp.)
cites work: The Magma algebra system. I: The user language
cites work: The Geometry of Two-Weight Codes
cites work: Six new binary quasi-cyclic codes
cites work: New Quasi-Cyclic Codes From Simplex Codes
cites work: Some results on quasi-cyclic codes
cites work: New quasi-twisted degenerate ternary linear codes
cites work: New good quasi-cyclic ternary and quaternary linear codes
cites work: New ternary linear codes
cites work: New minimum distance bounds for linear codes over GF(5).
cites work: Optimal ternary quasi-cyclic codes
cites work: New optimal ternary linear codes
cites work: Nine good rate (m-1)/pm quasi-cyclic codes
cites work: Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
cites work: New good rate \((m-1)/pm\) ternary and quaternary quasi-cyclic codes
cites work: Improved bounds for ternary linear codes of dimension 7
cites work: Improved bounds for quaternary linear codes of dimension 6.
cites work: Q4552217
cites work: Improved bounds for ternary linear codes of dimension 8 using tabu search
cites work: Some new binary, quasi-cyclic codes
cites work: A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
cites work: New ternary quasi-cyclic codes with better minimum distances
cites work: Self-orthogonal quasi-cyclic codes
cites work: On quasi-cyclic codes with rate l m (Corresp.)
cites work: The intractability of computing the minimum distance of a code
cites work: Quasi-cyclic codes over \(\mathbb F_{13}\) and enumeration of defining polynomials
DOI: 10.1007/S10623-014-9950-8
description: scientific article; zbMATH DE number 6486875