A brief tour of split linear programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1255, Issue , 1997, Pages 165-173

  Jaffe, David B ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CODES (SYMBOLS);

BINARY LINEAR CODES;

LINEAR PROGRAMMING;

EID: 84957809676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63163-1_13     Document Type: Conference Paper

References (15)

1. Bierbrauer, J. and Y. Edel: Construction of digital nets from BCH-codes, preprint.
2. Bierbrauer, J. and Y. Edel: Parameters for binary codes, preprint, accessible over the World Wide Web via http://www.math.mtu.edu/home/math/jbierbra/Home.html, 1996.
3. Brouwer, A. E.: The linear programming bound for binary linear codes, IEEE Trans. Inform. Theory 39 (1993), 677-680.
4. Brouwer, A. E. and T. Verhoeff: An updated table of minimum-distance bounds for binary linear codes, IEEE Trans. Inform. Theory 39 (1993), 662-677, supplemented by on-line updates: information regarding [n, k, d] codes with fixed n,k is accessible over the World Wide Web via http://www.win.tue.nl/win/math/dw/voorlincod.html and may also be obtained by sending electronic mail to aeb@cwi.nl with the subject exec lincodbd and a message body consisting of the single line lincodbd 2 n k.
5. Delsarte, P.: Bounds for unrestricted codes, by linear programming, Philips Res. Reports 27 (1972), 272-289.
6. Heijnen, P. W.: Er bestaat geen binaire [33,9,13] code, Afstudeerverslag, T. U. Delft, 1993.
7. ~djaffe/codes/code.ps.gz or code.dvi.gz.
8. Jaffe, D. B. and D. Ruberman: A sextic surface cannot have 66 nodes, J. of Algebraic Geometry 6 (1997), 151-168.
9. Kostova, B. K. and N. L. Manev: A [25,8,10] code does not exist, C. R. Acad. Bulgare Sci. 43 (1990), 41-44.
10. Lawrence, K. M.: Construction of (t,m,s)-nets and orthogonal arrays from binary codes, preprint, 1996.
11. Lawrence, K. M., A. Mahalanabis, G. L. Mullen and W. C. Schmid: Finite Fields and Applications: proceedings of the third international conference, Glasgow, July 1995, Cambridge Univ. Press, ed. S. Cohen, H. Niederreiter, 1996.
12. MacWilliams, F. J. and N. J. A. Sloane: The Theory of Error-Correcting Codes, North-Holland (Amsterdam), 1977.
13. Simonis, J.: MacWilliams identities and coordinate partitions, Linear Algebra Appl. 216 (1995), 81-91.
14. van Tilborg, H.: On the uniqueness resp. nonexistence of certain codes meeting the Griesmer bound, Inform, and Control 44 (1980), 16-35.
15. Ytrehus, Ø. and T. Helleseth: There is no binary [25,8,10] code, IEEE Trans. Inform. Theory 36 (1990), 695-696.