The binary weight distribution of the extended (2 m,2 m-4) code of the Reed-Solomon code over GF(2 m) with generator polynomial (x-\(\alpha\) )(x- \(\alpha\) 2)(x-\(\alpha\) 3) (Q1106181)

From MaRDI portal
Revision as of 16:33, 19 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: reviewed by (P1447): Item:Q587680)
scientific article
Language Label Description Also known as
English
The binary weight distribution of the extended (2 m,2 m-4) code of the Reed-Solomon code over GF(2 m) with generator polynomial (x-\(\alpha\) )(x- \(\alpha\) 2)(x-\(\alpha\) 3)
scientific article

    Statements

    The binary weight distribution of the extended (2 m,2 m-4) code of the Reed-Solomon code over GF(2 m) with generator polynomial (x-\(\alpha\) )(x- \(\alpha\) 2)(x-\(\alpha\) 3) (English)
    0 references
    0 references
    0 references
    1988
    0 references
    Let C be an [n,k] linear code over GF(2 m). The binary [nm,km] linear code obtained from C by representing each code symbol by the corresponding binary m-tuple using given basis of GF(2 m) over GF(2), is called binary image of C. Some general results such as the description of the dual code of a binary image of a code and a lower bound on the minimum weight of a binary image of a cyclic code are presented in the paper. Also, the weight enumerator for a binary image of the extended (2 m,2 m-4) Reed-Solomon code over GF(2 m) with generator polynomial (x- \(\alpha)\)(x-\(\alpha\) 2)(x-\(\alpha\) 3) where \(\alpha\) is a primitive element of GF(2 m).
    0 references
    weight distribution
    0 references
    binary image
    0 references
    Reed-Solomon code
    0 references

    Identifiers