Constructing linear codes from some orbits of projectivities

DOI10.1016/J.DISC.2007.07.045MaRDI QIDQ2470452zbMATH OpenOpenAlexFDO

Authors Tatsuya Maruta, Maori Shinohara, Mito Takenaka

Publication date 14 February 2008

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.07.045

zbMATH Keywords

extending and shortening of codesextension of linear codesfunctioningoptimal codesprojectivitypseudo-cyclic codesquasi-twisted codes

Mathematics Subject Classification ID

Combinatorial structures in finite projective spaces (51E20) Linear codes (general theory) (94B05) Cyclic codes (94B15)

Review text

It is proved that a linear code defined by some orbits of a projectivity is a degenerate quasi-twisted code. A lot of new linear codes over the field of \(q\) elements (\(q=3,4,5,8,9\)) improving the best known bounds (e.g., an optimal [90,9,54]\(_{3}\) code) are found from such codes by some combinations of puncturing or extending. It is achieved by optimizing one of the well-known parameters \(n\), \(k\), \(d\) of a code in coding theory for gaining the corresponding punctured and shortened code. The paper contains a lot of newly obtained best codes in some sense.

Recommendations

• Construction of a class of linear codes
• A construction of orbit codes
• The construction of orbit codes based on singular linear space over finite fields
• A construction of codes with linearity from two linear codes
• Linear codes over finite fields and finite projective geometries
• Constructions of projective linear codes by the intersection and difference of sets
• scientific article; zbMATH DE number 5054194
• scientific article; zbMATH DE number 3882337
• On the Bounds of Certain Maximal Linear Codes in a Projective Space

Cites work

• A Class of 1-Generator Quasi-Cyclic Codes
• Adding a parity-check bit
• An extension theorem for linear codes
• Classification of pseudo-cyclic MDS codes
• Extendability of linear codes over \(\operatorname {GF}(q)\) with minimum distance \(d\), \(\operatorname {gcd}(d,q)=1\)
• Extendability of quaternary linear codes
• Extendability of ternary linear codes
• Fundamentals of Error-Correcting Codes
• scientific article; zbMATH DE number 4211965 (Why is no real title available?)
• scientific article; zbMATH DE number 1284417 (Why is no real title available?)
• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• scientific article; zbMATH DE number 1795249 (Why is no real title available?)
• scientific article; zbMATH DE number 3318360 (Why is no real title available?)
• New binary one-generator quasi-cyclic codes
• New minimum distance bounds for linear codes over GF(5).
• New quasi-twisted degenerate ternary linear codes
• New quasi-twisted quaternary linear codes
• On the existence of cyclic and pseudo-cyclic MDS codes
• On the extendability of linear codes
• Optimal ternary linear codes
• Optimal ternary quasi-cyclic codes

Cited in

(8)

• Twisted tensor product codes
• On the dual codes of skew constacyclic codes
• On the minimum length of linear codes over \(\mathbb{F}_5\)
• Some new quasi-twisted ternary linear codes
• On optimal linear codes of dimension 4
• On the minimum length of linear codes over the field of 9 elements
• On the construction of optimal linear codes of dimension four
• Some high-rate linear codes over \(\text{GF}(5)\) and \(\text{GF}(7)\)

This page was built for publication: Constructing linear codes from some orbits of projectivities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2470452)