The structure of 1-generator quasi-twisted codes and new linear codes (Q5960286)

From MaRDI portal
Revision as of 04:26, 22 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1727956
Language Label Description Also known as
English
The structure of 1-generator quasi-twisted codes and new linear codes
scientific article; zbMATH DE number 1727956

    Statements

    The structure of 1-generator quasi-twisted codes and new linear codes (English)
    0 references
    0 references
    0 references
    15 April 2002
    0 references
    A quasi-twisted code is a linear code that is closed under a map of the form \((c_0,\ldots ,c_{n-1})\rightarrow (ac_{0-L} ,\ldots , ac_{(L-1)-L}, c_{L-1}, \ldots ,c_{n-L-1})\), where \(a\in\mathbb F_q^{\times}\). This paper studies BCH and Varshamov bounds, generators, distance, and gives specific examples.
    0 references
    0 references
    quasi-twisted codes
    0 references
    BCH bounds
    0 references
    ternary codes
    0 references
    Varshamov bounds
    0 references
    generators
    0 references
    distance
    0 references

    Identifiers