Constacyclic codes over finite fields (Q690432): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Hong-wei Liu / rank
Normal rank
 
Property / author
 
Property / author: Hong-wei Liu / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GAP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2099693138 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1301.0369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generators of Z/sub 4/ cyclic codes of length 2/sup e/ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of constacyclic codes over a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negacyclic codes over Z/sub 4/ of even length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repeated-root constacyclic codes of length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic codes over \(\mathbb Z_4\) of even length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constacyclic codes, cocycles and a u+v|u-v construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Error-Correcting Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3509721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435447 / rank
 
Normal rank

Latest revision as of 21:53, 5 July 2024

scientific article
Language Label Description Also known as
English
Constacyclic codes over finite fields
scientific article

    Statements

    Constacyclic codes over finite fields (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 November 2012
    0 references
    Let \(\mathbb{F}_q\) be the finite field with \(q=p^m\) elements. Constacyclic codes are a generalization of cyclic codes, which can be represented by ideals in \(\mathbb{F}_q [X] / \langle X^n - \lambda \rangle\) with \(\lambda \in \mathbb{F}_q^\ast\). Therefore, any constacyclic code is generated by a factor of \(X^n - \lambda\). It follows that for \(\lambda=1\), constacylic codes are cyclic codes. In the article under review, the generators of constacyclic codes of length \(\ell^t p^s\) are characterized, where \(\ell\) is a prime different from \(p\) and \(t,s\) are non-negative integers. An equivalence relation on \(\mathbb{F}_q^\ast\) is defined to perform such classification: \(\lambda\) is said to be isometric to \(\mu\) if there is a map \(\varphi: \mathbb{F}_q [X] / \langle X^n - \lambda \rangle \to \mathbb{F}_q [X] / \langle X^n - \mu \rangle\) that preserves the Hamming distance. The authors show that the irreducible factors of the generator of a constacylic code of length \(\ell^t p^s\) are binomials and trinomials, except for codes that are isometric to cyclic codes. The theory is illustrated with examples and tables of codes, worked out with the help of the computational discrete algebra system GAP.
    0 references
    0 references
    finite field
    0 references
    constacyclic code
    0 references
    isometry
    0 references
    polynomial generator
    0 references

    Identifiers