Adding a parity-check bit

IEEE Transactions on Information Theory

Volumn 46, Issue 4, 2000, Pages 1544-1545

  Simonis, Juriaan ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; LINEAR PROGRAMMING; THEOREM PROVING; TWO DIMENSIONAL; VECTORS;

CODE EXTENSION; LINEAR CODE; ONE CODIMENSIONAL SUBCODE; PARITY CHECK BIT;

BINARY CODES;

EID: 0034228605     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.850691     Document Type: Article

References (6)

1. A. E. Brouwer, Bounds on the size of linear codes, in Handbook of Coding Theory, V. S. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: Elsevier, 1998.
2. P. Delsarte, J.-M. Goethals, and F. J. MacWilliams, On generalized Reed-Muller codes and their relatives, Inform. Contr., vol. 16, pp. 403-442, 1970.
3. S. Guritman, F. Hoogweg, and J. Simonis, The degree of functions and weights in linear codes, Discr. Appl. Math., to be published.
4. R. Hill and P. Lizak, Extensions of linear codes, in Proc. Int. Symp. Information Theory, Whistler, BC, Canada, 1995, p. 345.
5. R. Hill, An extension theorem for linear codes, in Des. Codes Cryptogr., 1999, vol. 17, pp. 151-157.
6. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, 2nd ed. Amsterdam, New York, Oxford: North-Holland, 1983.