Title :
Lower bounds on the cross-correlation for codes of a given size
Author :
Levenshtein, Vladimir I.
Author_Institution :
Inst. of Appl. Math., Acad. of Sci., Moscow, Russia
fDate :
27 Jun-1 Jul 1994
Abstract :
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
Keywords :
codes; correlation methods; linear programming; polynomials; asymptotics; code length; code size; complex codes; cross-correlation; linear programming method; lower bounds; polynomials; real codes; Jacobian matrices; Linear programming; Mathematics; Polynomials; Quaternions; Upper bound; Vectors;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394898
