Abstract
Various generalizations of the Griesmer bound to minimum support weights are given. The chain condition for codes of lengths at most 2 above the Griesmer bound is discussed.
Research supported by the Norwegian Research Council
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
H. Chung, ”The second generalized Hamming weight of double-error correcting BCH codes and their dual codes”, in: Algebraic Algorithms and Error-Correcting Codes Conf., New Orleans, LA, 1991.
H. Chung, ”The second generalized Hamming weight of double-error correcting BCH codes and their dual codes”, in: Lecture Notes in Comp. Science, vol. 539, 118–129, Springer-Verlag 1991.
G. Cohen, S. Litsyn, and G. Zémor, ”Upperbounds on generalized distances”, submitted for publication.
G. Cohen, L. Huguet, and G. Zémor, ”Bounds on generalized weights”, presented at the first French-Israeli Workshop on Algebratic Coding, Paris, July 1993.
I. Duursma, H. Stichtenoth, and C. Voß, ”Generalized Hamming weights for duals of BCH codes and maximal algebraic function fields”, preprint 1993.
S. Encheva and T. Kløve, ”Codes satisfying the chain condition”, Reports in informatics, no. 70, Department of Informatics, University of Bergen, October 1992; to appear in IEEE Trans. Info. Theory, vol. IT-40, January 1994.
G. L. Feng, K. K. Tzeng, and V. K. Wei, ”On the Generalized Hamming Weights of Several Classes of Cyclic Codes”, IEEE Trans. Info. Theory, vol. IT-38, pp. 1125–1130, 1992.
G. D. Forney, ”Dimension/length profiles and trellis complexity of linear block codes”, manuscript, October 1993.
G. van der Geer and M. van der Vlugt, ”On generalized Hamming weights of BCH-codes”, Report 92-19, Dept. of Mathematics and Computer Science, Univ. of Amsterdam, 1992.
G. van der Geer and M. van der Vlugt, ”The second generalized Hamming weight of the dual codes of double-error correcting binary BCH-codes”, Manuscript, December 1992.
J. H. Griesmer, ”A bound for error-correcting codes”, IBM J. Res. Develop., vol. 4, 532–542, 1960.
T. Helleseth, T. Kløve, J. Mykkeltveit, ”The weight distribution of irreducible cyclic codes with block lengths n 1((q l−1)/N)”, Discrete Math., vol. 18, pp. 179–211, 1977.
T. Helleseth, T. Kløve, Ø. Ytrehus, ”Generalized Hamming weights of linear codes”, IEEE Trans. Inform. Theory, vol. IT-38, pp. 1133–1140, 1992.
T. Helleseth, T. Kløve, Ø. Ytrehus, ”Codes and the chain condition”, Proc. Int. workshop on Algebraic and Combinatorial Coding Theory, Voneshta Voda, Bulgaria June 22–28, 1992, pp. 88–91.
T. Helleseth, T. Kløve, Ø. Ytrehus, ”Excess sequences of codes and the chain condition”, Reports in informatics, no. 65, Department of Informatics, University of Bergen, July 1992.
T. Helleseth, T. Kløve, Ø. Ytrehus, ”Codes, weight hierarchies, and chains”, Proc. ICCS/ISITA '92, Singapore, 16–20 November 1992, 608–612.
T. Helleseth, T, Kløve, V. Levenshtein, and Ø. Ytrehus, ”Bounds on the minimum support weights”, submitted for publication.
T. Helleseth and P. V. Kumar, ”On the weight hierarchy of semiprimitive codes”, submitted for publication.
T. Helleseth and P. V. Kumar, ”The weight hierarchy of the Kasami codes”, to appear in Discrete Math..
J. W. Hirschfeld, M. A. Tsfasman, and S. G. Vladut, ”The weight hierarchy of higher-dimensional Hermitian codes”, manuscript, August 1992.
G. Kabatianski, ”On second generalized Hamming weight”, Proc. Int. workshop on Algebraic and Combinatorial Coding Theory, Voneshta Voda, Bulgaria June 22–28, 1992, pp. 98–100.
T. Kløve, ”The weight distribution of linear codes over GF(q l) having generator matrix over GF(q), Discrete Mathematics, Vol. 23, pp. 159–168, 1978.
T. Kløve, ”Support weight distribution of linear codes”, Discrete Math., vol. 106/107, pp. 311–316, 1992.
T. Kløve, ”Minimum support weights of binary codes”, IEEE Trans. Inf. Theory, vol. IT-39, pp. 648–654, 1993.
D. Nogin, ”Generalized Hamming weights for codes on multi-dimensional quadrics”, Problems Inform. Transmission, to appear.
J. Simonis, ”The effective length of subcodes”, manuscript, 1992.
H. Stichtenoth and Conny Voß, ”Generalized Hamming weights of trace codes”, manuscript, 1993.
M. van der Vlugt, ”On generalized Hamming weights of Melas codes”, Report, Mathematical Inst., Univ. of Leiden, October 1992.
Zhe-xian Wan, ”The weight hierarchies of the projective codes from nondegenerate quadrics”, manuscript, 1992.
V. K. Wei, ”Generalized Hamming Weights for Linear Codes”, IEEE Trans. Inform. Theory, vol. IT-37, pp. 1412–1418, 1991.
V. K. Wei and K. Yang, ”On the generalized Hamming weights of squaring construction and product codes”, manuscript, 1991.
K. Yang, P. V. Kumar, and H. Stichtenoth, ”On the weight hierarchy of geometric Goppa codes”, preprint, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Helleseth, T., Kløve, T., Ytrehus, Ø. (1994). Generalizations of the Griesmer bound. In: Chmora, A., Wicker, S.B. (eds) Error Control, Cryptology, and Speech Compression. ECCSP 1993. Lecture Notes in Computer Science, vol 829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58265-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-58265-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58265-6
Online ISBN: 978-3-540-48588-9
eBook Packages: Springer Book Archive