Lower bounds on the cross-correlation for codes of a given size
V.I. Levenshtein · 2002
The best known lower bounds on the cross-correlation of real and complex codes of a given size obtained by the author in 1982 are investigated. For a certain range of parameters these bounds are strengthened. Their optimality in the framework of the linear programming method for polynomials of bounded degree is proved. New asymptotics for the code size growing polynomially in length are given.>