Classical codes as ideals in group algebras (Q1200298): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of group codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3953694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Extended Reed-Solomon Codes Considered as Ideals or a Modular Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure of the Group Ring of a p-Group Over a Modular Field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on cyclic codes which are invariant under the affine group and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visible codes / rank
 
Normal rank

Latest revision as of 11:53, 17 May 2024

scientific article
Language Label Description Also known as
English
Classical codes as ideals in group algebras
scientific article

    Statements

    Classical codes as ideals in group algebras (English)
    0 references
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    Let \(p\) be a prime and let \({\mathbf F}_ q\) be a finite field with \(q=p^ m\) elements. The group ring \({\mathbf F}_ p[{\mathbf F}_ q]\) is isomorphic to the knotted polynomial ring \({\mathbf F}_ p[X_ 1,\dots,X_ m]/(X^ p_ 1,\dots,X^ p_ m)\). This is a local ring with maximal ideal \(M=(X_ 1,\dots,X_ m)\). Using only some elementary properties of this ring, the authors show that the ideals \(M^ j\) are naturally isomorphic to the \(((p-1)m-j)\)-th order Generalized Reed-Muller codes over \({\mathbf F}_ p\). They prove a somewhat weaker result when the basefield is a proper extension of \({\mathbf F}_ p\). As an application of their approach, the authors present a new decoding algorithm for binary Reed-Muller codes.
    0 references
    0 references
    0 references
    generalized Reed-Muller codes
    0 references
    finite field
    0 references
    group ring
    0 references
    knotted polynomial ring
    0 references
    local ring
    0 references
    decoding algorithm for binary Reed-Muller codes
    0 references