Generalized hamming weights of ç-ary reed-muller codes

IEEE Transactions on Information Theory

Volumn 44, Issue 1, 1998, Pages 181-196

  Heijnen, Petra ^a   Pellikaan, Ruud ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; POLYNOMIALS;

GENERALIZED HAMMING WEIGHTS (GHW); REED MULLER CODES;

CODES (SYMBOLS);

EID: 0031701779     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.651015     Document Type: Article

References (44)

1. A. Ashikhmin, "Generalized hamming weights of Reed-Muller code over GF(3)" (in Russian), Institute for Problems of Information Transmission, a chapter in the Ph.D. dissertation, Moscow, 1994.
2. S. Bezrukov and P. Heijnen, "On minimal ideals in Macaulay posets, preprint, Feb. 1996.
3. M. Boguslavsky, "On the number of solutions of polynomial systems, to be published in Finite Fields and their Applications.
4. B. Buchberger, "Ein Algorithmus zum Auffinden der Basiselemente de Restklassenringes nach einem nulldimensionalen Polynomideal," Ph.D dissertation, Univ. of Innsbruck, Innsbruck, Austria, 1965.
5. G.F. Clements and B. Lindström, "A generalization of a combinatoria theorem of Macaulay," J. Comb. Theory, vol. 7, pp. 230-238, 1969.
6. D. Cox, J. Little, and D. O'Shea, Ideals, Varieties, and Algorithms: A Introduction to Computational Algebraic Geometry. Berlin, Germany Springer-Verlag, 1992.
7. P. Delsarte, J. M. Goethals, and F. J. MacWilliams, "On generalize Reed-Muller codes and their relatives," Inform. Contr., vol. 16, pp 403-442, 1970.
8. S.B. Encheva, "On binary linear codes which satisfy the two-way chai condition," IEEE Trans. Inform. Theory, vol. 42, pp. 1038-1047, Ma 1996.
9. O. Endler, Valuation Theory (Universitext). Berlin, Germany Springer-Verlag, 1972.
10. G.-L. Feng and T. R. N. Rao, "Decoding of algebraic geometric code up to the designed minimum distance," IEEE Trans. Inform. Theory vol. 39, pp. 37-45, Jan. 1993.
11. G.-L. Feng and T. R. N. Rao, "A simple approach for constructio of algebraic-geometric codes from affine plane curves," IEEE Trans Inform. Theory, vol. 40, pp. 1003-1012, July 1994.
12. G.-L. Feng, V. Wei, T. R. N. Rao, and K. K. Tzeng, "Simplifie understanding and efficient decoding of a class of algebraic-geometri codes," IEEE Trans. Inform. Theory, vol. 40, pp. 981-1002, July 1994.
13. G.D. Forney, Jr., "Dimension/length profiles and trellis complexit of linear block codes," IEEE Trans. Inform. Theory, vol. 40, pp 1741-1752, Nov. 1994.
14. -, "Dimension/length profiles and trellis complexity of lattices, IEEE Trans. Inform. Theory, vol. 40, pp. 1753-1772, Nov. 1994.
15. T. Helleseth, T. K10voe, and J. Mykkelveit, "The weight distibution o irreducible cyclic codes with block lengths n\((ql -1)/JV)," Discr Math., vol. 18, pp. 179-211, 1977.
16. T. H0holdt, J. H. van Lint, and R. Pellikaan, "Algebraic geometr codes," to be published in Handbook of Coding Theory, R. A. Brualdi W. C. Huffman, and V. Pless, Eds.. Amsterdam, The Netherlands Elsevier.
17. T. H0holdt and R. Pellikaan, "On decoding algebraic-geometric codes, IEEE Trans. Inform. Theory, vol. 41, pp. 1589-1614, Nov. 1995.
18. T. Kasami, S. Lin, and W. W. Peterson, "New generalization o Reed-Muller codes, Part 1: Primitive codes," IEEE Trans. Inform Theory, vol. IT-14, pp. 189-199, 1968.
19. -, "Polynomial codes," IEEE Trans. Inform. Theory, vol. IT-14 pp. 807-814, 1968.
20. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, "On the optimum bi orders with respect to the state complexity of trellis diagrams for linea binary codes," IEEE Trans. Inform. Theory, vol. 39, pp. 242-245, Jan 1993.
21. -, "On complexity of trellis structure of linear block codes," IEE Trans. Inform. Theory, vol. 39, pp. 1057-1064, May 1993.
22. G.O. H. Katona, "A theorem of finite sets," in Theory of Graphs Proceedings of the Colloquium held at Tihany (Hungary, Sept. 1966), P Erdös and G. Katona, Eds.. New York: Academic; Budapest, Hungary Akademia Kiado, 1968, pp. 187-207.
23. C. Kirfel and R. Pellikaan, "The minimum distance of codes in an arra coming from telescopic semigroups," IEEE Trans. Inform. Theory, vol 41, pp. 1720-1732, Nov. 1995.
24. T. K10ve, "The weight distribution of linear codes over GF(g') havin generator matrix over GF(q)," Discr. Math., vol. 23, pp. 159-168, 1978.
25. -, "Support weight distribution of linear codes," Discr. Math., vol 106/107, pp. 311-316, 1992.
26. J.B. Kruskal, "The optimal number of simplices in a complex," i Mathematical Optimization Techniques. Berkeley, CA: Univ. Calif Press, 1963, pp. 251-268.
27. F.S. Macaulay, "Some properties of enumeration in the theory o modular ystems," Proc. London Math. Soc., vol. 26, pp. 531-555, 1927.
28. R.E. Muller, "Application of Bollean algebra to switching circuit desig and to error detection," IRE Trans. Electron. Comput., vol. EC-3, pp 6-12, 1954.
29. C. Munuera, "On the generalized Hamming weights of geometric Goppa codes," IEEE Trans. Inform. Theory, vol. 40, pp. 2092-2099, Nov. 1994
30. R. Pellikaan, "The shift bound for cyclic, Reed-Muller and geometric Goppa codes," in Arithmetic, Gemetry and Coding Theory, R. Pellikaan, M. Perret, and S. G. Vlädu;, Eds. Berlin, Germany: Walter de Gruyter, 1996, pp. 155-175
31. [31 ] __, "On the existence of order and weight functions," to be published in J. Statist. Planning and Inference
32. I.S. Reed, "A class of multipleor-correcting codes and the decoding scheme," IRE Trans. Inform. Theory, vol. PGIT-4, pp. 38-49, 1954
33. J. Simonis, "The effective length of subcodes," AAECC, vol. 5, pp. 371-377, 1994
34. A.B. S0rensen, "Projective Reed-Muller codes," IEEE Trans. Inform. Theory, vol. 37, pp. 1567-1576, Nov. 1991
35. -, "Weighted projective Reed-Muller codes and algebraic geometric codes," IEEE Trans. Inform. Theory, vol. 38, pp. 1821-1826, 1992
36. H. Stichtenoth, Algebraic Function Fields and Codes (Universitext). Berlin, Germany: Springer-Verlag, 1993
37. M.A. Tsfasman and S. G. Vlädu;, Algebraic Geometric Codes (Mathematics and its Applications, vol. 58). Dordrecht, The Netherlands: Kluwer, 1991.
38. -, "Survey on generalized Hamming weights," IEEE Trans. Inform Theory, vol. 41, pp. 1564-1588, Nov. 1995.
39. K. Yang, P. V. Kumar, and H. Stichtenoth, "On the weight hierarch of geometric Goppa codes," IEEE Trans. Inform. Theory, vol. 40, pp 913-920, May 1994.
40. V.K. Wei, "Generalized Hamming weights for linear codes," IEE Trans. Inform. Theory, vol. 37, pp. 1412-1418, Sept. 1991.
41. V.K. Wei and K. Yang, "On the generalized Hamming weights o product codes," IEEE Trans. Inform. Theory, vol. 39, pp. 1709-1713 Sept. 1993.
42. E.J. Weldon, "New generalizations of the Reed-Muller codes. Par II: Nonprimitive codes," IEEE Trans. Inform. Theory, vol. IT-14, pp 199-205, 1968.
43. X.-W. Wu, "Generalized Hamming weights of some classes of projectiv codes," Ph.D. dissertation, Institute of System Sciences, Beijing, China May 1995.
44. T. Shibuya, J. Mizutani, and K. Sakaniwa, "On generalized Hammin weights of codes constructed on affine algebraic sets," in Proc. AAECC 12, Lecture Notes in Computer Science, vol. 1255. Berlin, Germany Springer-Verlag, 1977, pp. 311-320.