Lengthening and the Gilbert-Varshamov bound

IEEE Transactions on Information Theory

Volumn 43, Issue 3, 1997, Pages 991-992

  Edel, Yves ^a   Bierbrauer, Jürgen ^b  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b MICHIGAN TECHNOLOGICAL UNIVERSITY   (United States)

Author keywords

Gilbert Varshamov bound; Lengthening; Linear codes

Indexed keywords

DATABASE SYSTEMS; PARAMETER ESTIMATION; SET THEORY; THEOREM PROVING; VECTORS;

LINEAR CODES;

CODES (SYMBOLS);

EID: 0031140638     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.568708     Document Type: Article

References (4)

1. J. Bierbrauer and Y. Edel, "Extending and lengthening BCH-codes," Finite Fields and Their Applications, to be published.
2. A. E. Brouwer, "Data base of bounds for the minimum distance for binary, ternary and quaternary codes," URL [On line}. Avaiable WWW: http://www.win.tue.nl/win/math/dw/voorlincod.html or URL http://www.cwi.nl/htbin/aeb/lincodbd/2/136/114 or URL ftp://ftp.win.tue.nl/pub/math/codes/table[234].gz.
3. F. J. McWilliams and N. J. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
4. D. Schomaker and M. Wirtz, "On binary cyclic codes of length from 101 to 127," IEEE Trans. Inform. Theory, vol. 38, pp, 516-518, 1992.