1
vote
0answers
31 views

Upper bound for constant weight code L(n,d,w), with n=128, d=4

I would like to find an upper bound: L(n,d,w) <= f(n,d,w) for a constant weight code L(n,d,w), where w is the maximum weight, d is the Hamming distance between codes, and n is the code length. I ...
2
votes
0answers
65 views

Out of all combinations (n,k), largest set such that each combination overlaps with others by d or less.

This problem is relevant to determining the number of discriminable combinations of components in a sensory perception task. Suppose that there are N components to choose from, and we are only ...
1
vote
1answer
172 views

perfect binary e-error correcting code

let C be a perfect binary e-error correcting code of length n. assume 0 is a symbol and that 0 vector is a codeword.show that P={1,2,...,n} together with supports of codewords of weight 2e+1form an ...