Constructing linear codes from some orbits of projectivities (Q2470452): Difference between revisions

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.