Selbstduale Codes über dem Ring der ganzen Zahlen modulo 4. (Self-dual codes over the ring of integers modulo 4) (Q1104908): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Über die Identität von MacWilliams für die Gewichtsfunktion von Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-dual codes over GF(4) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weight enumerators of self-orthogonal codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weight Enumerators of Self-Orthogonal Codes over $GF$(3) / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01198572 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094675601 / rank
 
Normal rank

Latest revision as of 08:49, 30 July 2024

scientific article
Language Label Description Also known as
English
Selbstduale Codes über dem Ring der ganzen Zahlen modulo 4. (Self-dual codes over the ring of integers modulo 4)
scientific article

    Statements

    Selbstduale Codes über dem Ring der ganzen Zahlen modulo 4. (Self-dual codes over the ring of integers modulo 4) (English)
    0 references
    0 references
    1989
    0 references
    Let W be the complete weight enumerator of a self-dual linear code over the ring of integers modulo 4. Then W is invariant for a group of order 64. We show that the Molien series of this group is \((1+\lambda^{10})/(1-\lambda)(1-\lambda \quad 4)^ 2(1-\lambda \quad 8),\) and we determine a good polynomial basis for the ring of invariants. Further, if we assume, that the code contains the repetition code, we get a group of order 1024, and we determine the Molien series and a good polynomial basis for this group too. All computations can be done by hand, observing the fact that the groups are monomial with respect to a suitable transformation. We also derive a MacWilliams identity for the complete weight enumerator of linear codes over arbitrary commutative finite rings.
    0 references
    self-dual codes
    0 references
    complete weight enumerator
    0 references
    Molien series
    0 references
    good polynomial basis
    0 references
    ring of invariants
    0 references
    repetition code
    0 references
    MacWilliams identity
    0 references

    Identifiers