Skip to main content
Log in

Optimal Subcodes of Second Order Reed-Muller Codes andMaximal Linear Spaces of Bivectors of Maximal Rank

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

There are exactlytwo non-equivalent [32,11,12]-codes in the binaryReed-Muller code \(\mathcal{R}\mathcal{M}(2,5)\) which contain \(\mathcal{R}\mathcal{M}(2,5)\)and have the weight set {0,12,16,20,32}. Alternatively,the 4-spaces in the projective space \(\mathbb{P}(\Lambda ^2 \mathbb{F}_2^5 )\)over the vector space \(\mathbb{P}(\Lambda ^2 \mathbb{F}_2^5 )\)for which all points have rank 4 fall into exactlytwo orbits under the natural action of PGL(5) on \(\mathbb{P}(\Lambda ^2 \mathbb{F}_2^5 )\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. E. F. Assmus, Jr. and J. D. Key, Designs and their codes, Cambridge Tracts in Mathematics, Vol. 103, Cambridge University Press, Cambridge (1992) x+352, pp. ISBN: 0–521–41361–3.

    Google Scholar 

  2. E. F. Assmus, Jr. and J. D. Key, Polynomial codes and finite geometries, Handbook of Coding Theory (V. S. Pless and W. C. Huffman, eds.), Elsevier, Amsterdam etc. (1998) ISBN 0–444–50088-X.

    Google Scholar 

  3. L. A. Bassalygo and V. A. A. Zinoviev, A remark on uniformly packed codes, (Russian) Problemy Peredachi Informatsii, Vol. 13, No. 3 (1977) pp. 22–25.

    Google Scholar 

  4. T. P. Berger, The automorphism group of double-error-correcting BCH codes, IEEE Trans. Inform. Theory, Vol. 40, No. 2 (1994) pp. 538–542.

    Google Scholar 

  5. T. P. Berger, Automorphism groups and permutation groups of affine-invariant codes, Proc. of 3rd Conf. on Finite Fields and Applications, London Math. Soc. Lecture Series, Cambridge Univ. Press, Glasgow, England, 233 (1996) pp. 31–45.

    Google Scholar 

  6. J. Bierbrauer, Introduction to codes and their use, Lecture notes MA 576, available on the author' web page http://www.math.mtu.edu/”jbierbra/.

  7. A. Canteaut, P. Charpin and H. Dobbertin, H. Binary m-sequences with three-valued cross-correlation: A proof of the Welch conjecture. Submitted to EEE Trans. Inform. Theory.

  8. P. Charpin, Weight distributions of cosets of two-error-correcting binary BCH codes, extended or not, IEEE Trans. Inform. Theory, Vol. 40, No. 5 (1994) pp. 1425–1442.

    Google Scholar 

  9. P. Charpin, Open problems on cyclic codes, Handbook of Coding Theory (V. S. Pless and W. C. Huffman, eds.), Elsevier, Amsterdam etc., (1998) ISBN 0–444–50088-X.

    Google Scholar 

  10. B. N. Cooperstein, External flats to varieties in PG2 V) over finite fields, Geom. Dedicata, Vol. 69 (1998) pp. 223–235.

    Google Scholar 

  11. J.-M. Goethals and H. C. A. van Tilborg, Uniformly packed codes, Philips Res. Rep., Vol. 30 (1975) pp. 9–36.

    Google Scholar 

  12. R. Gold, Maximal recursive sequences with 3-valued cross-correlation functions, IEEE Trans. Inform. Theory, Vol. 14, No. 1 (1968) pp. 154–156.

    Google Scholar 

  13. S. W. Golomb, Theory of transformation groups of polynomials over GF(2) with applications to linear shift register sequences, Information Sciences, Vol. 1 (1968) pp. 87–109.

    Google Scholar 

  14. J. Harris, Algebraic geometry. A first course, Graduate Texts in Mathematics, Springer-Verlag, New York, 133 (1992) xx+328, pp. ISBN: 0–387–97716–3.

    Google Scholar 

  15. H. D. L. Hollmann and Q. Xiang, A proof of the Welch and Niho conjectures on crosscorrelations of binary m-sequences, Preprint.

  16. T. Kasami, Weight distribution formula for some class of cyclic codes, University of Illinois, Urbana, Rept. R-265, April (1968).

    Google Scholar 

  17. T. Kasami, The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes, Information and Control, Vol. 18 (1971) pp. 369–394.

    Google Scholar 

  18. F. J. MacWilliams and N. J. A. Sloane, The theory of error-correcting codes, 2nd reprint, North-Holland Mathematical Library, Vol. 16. North-Holland Publishing Co., Amsterdam-New York-Oxford (1983) xx+762, pp. ISBN: 0–444–85009–0 and 0–444–85010–4.

    Google Scholar 

  19. M. Marcus, Finite dimensional multilinear algebra, Part II, Pure and Applied Mathematics, Vol. 23, Marcel Dekker, Inc., New York (1975) xvi+718.

    Google Scholar 

  20. R. J. McEliece, Quadratic forms over finite fields and second-order Reed-Muller codes, JPL Space Programs Summary, Vol. 37–58-III (1969) pp. 28–33.

    Google Scholar 

  21. Y. Niho, Multi-valued cross-correlation functions between two maximal linear recursive sequences, Ph.D. Thesis, Dept. Elec. Eng., Univ. Southern California (USCEE Rep. 409) (1972).

  22. N. V. Semakov, V. A. Zinoviev and G. V. Zaitsev, Uniformly close-packed codes, (Russian) Problemy Peredachi Informatsii, Vol. 7, No. 1 (1971) pp. 38–50.

    Google Scholar 

  23. R. Shaw, Linear algebra and group representations, Vol. II, Multilinear algebra and group representations, Academic Press, Inc. [Harcourt Brace Jovanovich, Publishers], London-NewYork (1983) ix+579, pp. ISBN: 0–12–639202–1.

    Google Scholar 

  24. R. Shaw and N. A. Gordon, The lines of PG(4; 2) are the points on a quintic in PG(9; 2), J. Combin. Theory Ser. A, Vol. 68, No. 1 (1994) pp. 226–231.

    Google Scholar 

  25. J. Simonis, Reed-Muller codes, Faculty of Technical Mathematics and Informatics, Rep. 87–23, ISSN 0920–8577, Delft University of Technology (1987).

  26. L. A. Welch, Trace mappings in finite fields and shift register cross-correlation properties, Electrical Engineering Department Report, University of Southern California (1969).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maks, J., Simonis, J. Optimal Subcodes of Second Order Reed-Muller Codes andMaximal Linear Spaces of Bivectors of Maximal Rank. Designs, Codes and Cryptography 21, 165–180 (2000). https://doi.org/10.1023/A:1008343829143

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008343829143

Navigation