Symmetric Polynomials and Some Good Codes
β Scribed by San Ling; Harald Niederreiter; Chaoping Xing
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 90 KB
- Volume
- 7
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
β¦ Synopsis
Elements from extensions of F O are employed to construct a class of linear codes over F O with good parameters through symmetric polynomials over F O .
π SIMILAR VOLUMES
We begin by classifying all solutions of two natural recurrences that Bernstein polynomials satisfy. The first scheme gives a natural characterization of Stancu polynomials. In Section 2, we identify the Bernstein polynomials as coefficients in the generating function for the elementary symmetric fu
We give a characterization of codes meeting the Grey Rankin bound. When the codes have even length, the existence of such codes is equivalent to the existence of certain quasi-symmetric designs. We also find the parameters of all linear codes meeting the Grey Rankin bound. ## 1997 Academic Press T
Starting from the Delsarte Genin (DG) mapping of the symmetric orthogonal polynomials on an interval (OPI) we construct a one-parameter family of polynomials orthogonal on the unit circle (OPC). The value of the parameter defines the arc on the circle where the weight function vanishes. Some explici