Lower bounds for constant weight codes. Abstract: Let A(n,2\delta,w) denote the maximum number of codewords in any binary code of length n , constant weight w , ...

GRAHAM AND SLOANE: LOWER BOUNDS FOR CONSTANT WEIGHT CODES. Then. A(n,28,w) ... GRAHAM AND SLOANE: LOWER BOUNDS FOR CONSTANT WEIGHT CODES. TABLE I. A(n,4,w).

Some new lower bounds are given for A(n,4,w), the maximum number of codewords in a binary code of length n, minimum distance 4, and constant weight w.

A(n, d, w) · 1-of-N codes · Balanced code · m-of-n codes

Oct 22, 2024 · Several lower bounds for A(n,2 delta ,w) are given. For w and delta fixed, A(n,2 delta ,w) greater than equivalent to n**w** minus ** delta ** ...

In this note we mention some improvements to the lower bounds for A(n, d, w), d ≤ 10 , given in [2] and [4]. We also mention several lower bounds for ...

The tables give the best known bounds on A(n,d,w) for all n up to 28 and all even d up to 14. For each n and d, w ranges from d/2+1 to the integer part of n/2.

For w and delta fixed, A(n,2delta,w) geq n^{W-delta+l}/w! and A(n,4,w)sim n^{w-l}/w! as n rightarrow infty . In most cases these are better than the "Gilbert ...

The maximum size of such a code is denoted by A(n, d, w). In this note we give improved lower bounds for A(n, d, w) for d = 4 and smallish n. The standard ...

On the minimum length of some linear codes · Eun Ju Cheon. Designs, Codes and Cryptography, 2007 ; A Note on Variable-Length Codes with Constant Hamming Weights.