Results on binary linear codes with minimum distance 8 and 10

IEEE Transactions on Information Theory

Volumn 57, Issue 9, 2011, Pages 6089-6093

  Bouyukliev, Iliya Georgiev ^a   Jacobsson, Erik ^b  

^a INSTITUTE OF MATHEMATICS AND INFORMATICS   (Bulgaria)

^b UNIVERSITY OF GOTHENBURG   (Sweden)

Author keywords

Algorithms; classification of codes; linear codes; optimal codes

Indexed keywords

BINARY LINEAR CODES; CODIMENSION; DEPENDENCY STRUCTURES; DUAL CODES; FAST ALGORITHMS; LINEAR BINARY CODE; LINEAR CODES; MAXIMUM CLIQUE; MINIMUM DISTANCE; OPTIMAL CODES;

ALGORITHMS;

EID: 80052347792     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2162264     Document Type: Article

References (16)

1. A. Barg, "Complexity issues in coding theory", in Handbook of Coding Theory, V. S. Pless and W. C. Huffman, Eds. Amsterdam: Elsevier, 1998.
2. I. Bouyukliev, "What is Q-extension?", Serdica J. Comput., vol. 1, pp. 115-130, 2007.
3. I. Bouyukliev, "About the code equivalence", in Advances in Coding Theory and Cryptology, T. Shaska, W. C. Huffman, D. Joyner, and V. Ustimenko, Eds.: World Scientific Publishing, 2007, vol. 2, Series on Coding Theory and Cryptology, pp. 126-151.
4. I. Bouyukliev, D. Jaffe, and V. Vavrek, "The smallest length of eightdimensional binary linear codes with prescribed minimum distance", IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1539-1544, Apr. 2000.
5. 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, pp. 295-461.
6. D. B. Jaffe, "Binary Linear Codes: New Results on Nonexistence", DraftVersion Accessible Through the Author's Web Page University of Nebraska, Dept. of Math. and Statistics, Lincoln, 1997 [Online]. Available: http://www.math.unl.edu/djaffe,0.4
7. D. B. Jaffe, "Optimal binary linear codes of length ≥ 30" Discrete Math., vol. 223, pp. 135-155, 2000.
8. M. Grassl, Code Tables: Bounds on the Parameters of Various Types of Codes [Online]. Available: http://www.codetables.de/
9. M. Halldorsson and E. Losievskaja, "Independent sets in boundeddegree hypergraphs", Discrete Appl. Math., vol. 157, pp. 1773-1786, 2009.
10. J. W. P. Hirschfeld and L. Storme, "The packing problem in statistics, coding theory, and finite projective spaces", J. Statist. Plann. Inf., vol. 72, pp. 355-380, 1998.
11. W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes. Cambridge, U. K.: Cambridge Univ. Press, 2003.
12. P. Kaski and P. R. Östergård, Classification Algorithms for Codes and Designs. New York: Springer, 2006.
13. R. Matsumoto, K. Kurosawa, T. Itoh, T. Konno, and T. Uyematsu, "Primal-dual distance bounds of linear codes with application to cryptography", IEEE Trans. Inf. Theory, vol. 52, pp. 4251-4256, 2006.
14. P. R. Östergård, "A fast algorithm for the maximum clique problem", Discrete Appl. Math., vol. 120, pp. 197-207, 2002.
15. P. R. Östergård, "Constructing combinatorial objects via cliques", in Surveys in Combinatorics, B. S. Webb, Ed. Cambridge, U. K.: Cambridge University Press, 2005, pp. 57-82.
16. V. Pless, W. C. Huffman, and R. Brualdi, "An introduction to algebraic codes", in Handbook of Coding Theory, V. S. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: Elsevier, 1998, pp. 177-294.