On the cardinality of sets of sequences with given maximum correlation

DOI10.1016/0012-365X(92)90577-3zbMath0787.90053MaRDI QIDQ1199639

Aimo Tietäväinen

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Sidelnikov bound

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear programming (90C05) Bounds on codes (94B65)

Related Items (1)

A large family of sequences with low periodic correlation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On character sums and codes
• Prime-phase sequences with periodic correlation properties better than binary sequences
• On lower bounds to the maximum correlation of complex roots-of-unity sequences
• Lower Bounds for the Maximum Moduli of Certain Character Sums
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Optimal binary sequences for spread spectrum multiplexing (Corresp.)

This page was built for publication: On the cardinality of sets of sequences with given maximum correlation