This website forms an electronic supplement to [1] and [2]. It contains tables of bounds on the size of binary unrestricted codes, constant-weight codes, doubly-bounded-weight codes, and doubly-constant-weight codes.
The site is maintained as an online resource for the best known upper bounds for these classes of binary block codes. Hence, we would like to hear of any progress that is made, such as improved bounds or corrections. Tables of lower bounds are available elsewhere; see the links below.
For definitions of these four classes of binary codes and their parameters, see [1].
Related tables of bounds for various classes of codes are maintained on the following sites.
[B] A. E. Brouwer: Upper and lower bounds for unrestricted binary, ternary, and quaternary codes. The tables constitute online versions of [4] and are regularly updated (2014).
[G] M. Grassl: Code Tables—Bounds on the parameters of various types of codes
[J] D. B. Jaffe: Upper and lower bounds for binary linear codes.
[LRS] S. Litsyn, E. M. Rains, and N. J. A. Sloane: Extensive tables of lower bounds for unrestricted binary codes. This is an online version of [6], updated until 1999.
[RS] E. M. Rains, and N. J. A. Sloane: Lower bounds for constant-weight binary codes, with upper bounds where they are known to coincide with the lower bounds. These tables, which unfortunately do not seem to be online anymore (2014), were an electronic supplement to [5].
[2] E. Agrell, A. Vardy, and K. Zeger, “A table of upper bounds for binary codes,” IEEE Transactions on Information Theory, vol. 47, no. 7, pp. 3004–3006, Nov. 2001. Correction
Erik Agrell
agrell@chalmers.se