Error-Correcting Codes over an Alphabet of Four Elements
Designs, Codes and Cryptography
Classifying Subspaces of Hamming Spaces
Designs, Codes and Cryptography
On Binary/Ternary Error-Correcting Codes with Minimum Distance 4
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Extending the Stable Model Semantics with More Expressive Rules
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Error correcting coding for a nonsymmetric ternary channel
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
The maximum number of codewords in a binary code with length n and minimum distance d is denoted by A(n, d). By construction it is known that A(10, 3)⩾72 and A(11, 3)⩾144. These bounds have long been conjectured to be the exact values. This is here proved by classifying various codes of smaller length and lengthening these using backtracking and isomorphism rejection. There are 562 inequivalent codes attaining A(10, 3)=72 and 7398 inequivalent codes attaining A(11, 3)=144