We consider the problem to construct a code of the maximum cardinality which consists of binary vectors of length n with three ones and has the following property: a matrix of size 3 times n from anyâ€¦ (More)

2006 IEEE International Symposium on Informationâ€¦

2006

A new upper bound on the cardinality of codes in the Hamming space with given minimum and maximum distances is proved. The bound is compared to some known bounds, and some classes of codes for whichâ€¦ (More)

It is known that polynomials f(t), such that the matrix f(rho(x,y)) with the Hamming distance rho(x,y) between vectors x=(x <sub>1</sub>,...,x<sub>n</sub>) and y=(y<sub>1</sub>,...,y<sub>n</sub>) isâ€¦ (More)