An efficient method to construct self-dual cyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \) (Q2174606)

From MaRDI portal
Revision as of 07:09, 1 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficient method to construct self-dual cyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \)
scientific article

    Statements

    An efficient method to construct self-dual cyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 April 2020
    0 references
    A code \(C\) over a ring is self-dual if \(C=C^\perp\), where \(C^\perp\) is the standard Euclidean dual. The code \(C\) is cyclic if \((c_0,c_1,\ldots,c_{n-1}) \in C\) implies \((c_{n-1}, c_0,c_1,\ldots,c_{n-2})\). The authors use combinatorial techniques to give an explicit representation and enumeration for all distinct self-dual cyclic codes of length \(p^s\) over the ring \(F_{p^m} [u] / \langle u^2 \rangle\). Additionally, they given an efficient method to construct every self-dual cyclic code in this setting.
    0 references
    cyclic code
    0 references
    self-dual code
    0 references
    linear code
    0 references
    Kronecker product of matrices
    0 references
    finite chain ring
    0 references

    Identifiers