Generalized Hamming Weights for Linear Codes

IEEE Transactions on Information Theory

Volumn 37, Issue 5, 1991, Pages 1412-1418

  Wei, Victor K ^a  

^a TELCORDIA TECHNOLOGIES   (United States)

Author keywords

code; cryptography; Hamming weight; Linear code; MDS; Reed Muller code

Indexed keywords

CODES, SYMBOLIC - ENCODING; MATHEMATICAL TECHNIQUES - ALGEBRA;

HAMMING WEIGHT; LINEAR CODE; MDS CODE; REED-MULLER CODE;

CRYPTOGRAPHY;

EID: 0026219389     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.133259     Document Type: Article

References (7)

1. I. Anderson, Combinatorics of Finite Sets. Oxford: Oxford Science Publications, 1987.
2. B. Chor, O. Goldreich, J. Hastad, J. Friedmann, S. Rudich, and R. Smolensky, “The bit extraction problem of /-resilient functions,” in Proc. 26th Symp. Found Comput. Sci., 1985, pp. 396–407.
3. J. Korner and V. K. Wei, “Odd and even Hamming spheres also have minimum boundary,” Discrete Math., pp. 147–165, 1984.
4. S. Lin and D. J. Costello Jr., Error-Control Coding: Fundamentals and Applications. New York: Prentice-Hall, 1983.
5. F. J. MacWilliams, and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1977.
6. L. H. Ozarow and A. D. Wyner, “Wire-tap-channel II,” AT&T Bell Labs Tech. J., vol. 63, pp. 2135–2157, 1984.
7. W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes. Cambridge, MA; MIT Press, 1972.