Bounds on the size of a code Page 1 Bounds on the Size of a Code Thomas Ericson
Department of Electrical Engineering, LinkSping University S-582 62 Link~ping, Sweden …

Let A (n, d) denote the maximum possible number of codewords in a binary code of length n
and minimum Hamming distance d. For large values of n, the best known upper bound, for …

New lower bounds for constant weight codes Page 1 1324 IEEE TRANSACTIONS ON
INFORMATION THEORY, VOL. 35. NO. 6. NOVEMBER 1989 On the other hand, the effect of …

Let A (n, 2 δ, w) denote the maximum number of codewords in any binary code of length n,
constant weight w, and Hamming distance 2 δ Several lower bounds for A (n, 2 δ, w) are …

A (n, d, w) is the maximum size of a binary code with word length n, minimum distance d,
and constant weight w. The tables below give the best known lower (and upper) bounds for …

The minimum support weight, d/sub r/(C), of a linear code C over GF (q) is the minimal size
of the support of an r-dimensional subcode of C. A number of bounds on d/sub r/(C) are …

This paper concerns itself with binary coding and more specifically with an upper bound for
the number of binary code works of length n such that every two differ in at least d positions …

A lower bound on the expected length of one-to-one codes Page 1 1670 IEEE
TRANSACTIONS ON INFORMATION THEORY, VOL. 40, NO. SEPTEMBER 1994 On the other …

A NEW UPPER BOUND ON CODES DECODABLE INTO SIZE-2 LISTS Page 1 A NEW UPPER
BOUND ON CODES DECODABLE INTO SIZE-2 LISTS Alexei Ashikhmin Los Alamos National …

Some new upper bounds for constant weight codes (Corresp.) Page 1 Some New Upper
Bounds for Constant Weight On the Rate-Distortion Function for the Nonstationary Codes …