Skew cyclic codes of arbitrary length (Q496128)

From MaRDI portal
Revision as of 10:20, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Skew cyclic codes of arbitrary length
scientific article

    Statements

    Skew cyclic codes of arbitrary length (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 September 2015
    0 references
    Summary: In this paper, we study a special type of linear codes, called skew cyclic codes, in the most general case. This set of codes is a generalisation of cyclic codes but constructed using a non-commutative ring called the skew polynomial ring. In previous works, these codes have been studied with certain restrictions on their length. This work examines their structure for an arbitrary length without any restriction. Our results show that these codes are equivalent to either cyclic codes or quasi-cyclic codes, hence establish strong connections with well-known classes of codes.
    0 references
    cyclic codes
    0 references
    skew cyclic codes
    0 references
    quasi-cyclic codes
    0 references
    equivalent codes
    0 references

    Identifiers