New lower bounds on aperiodic crosscorrelation of binary codes

DOI10.1109/18.746818zbMath0947.94030OpenAlexW2100018340MaRDI QIDQ4701271

Vladimir I. Levenshtein

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.746818

zbMATH Keywords

Chebyshev polynomialsbinary codesWelch boundaperiodic crosscorrelation

Mathematics Subject Classification ID

Bounds on codes (94B65)

Related Items (1)

A Fourier transform approach for improving the Levenshtein's lower bound on aperiodic correlation of binary sequences

This page was built for publication: New lower bounds on aperiodic crosscorrelation of binary codes