New lower bounds on aperiodic crosscorrelation of binary codes

DOI10.1109/18.746818zbMATH Open0947.94030OpenAlexW2100018340MaRDI QIDQ4701271FDOQ4701271

Vladimir 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

Recommendations

• New lower bounds on the aperiodic Hamming correlations of frequency hopping sequences with low hit zone
• New lower bounds on \(q\)-ary error-correcting codes
• On lower bounds on the spectrum of a binary code
• scientific article; zbMATH DE number 7274073
• A theoretical bounds on the aperiodic correlation functions of binary sequences
• New lower bounds and constructions for binary codes correcting asymmetric errors
• A Fourier transform approach for improving the Levenshtein's lower bound on aperiodic correlation of binary sequences
• New lower bounds for binary covering codes
• A new upper bound on the rate of non-binary codes
• A new lower bound on the minimal length of a binary linear code

zbMATH Keywords

Chebyshev polynomialsbinary codesWelch boundaperiodic crosscorrelation

Mathematics Subject Classification ID

Bounds on codes (94B65)

Cited In (4)

• On lower bounds to the maximum correlation of complex roots-of-unity sequences
• Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets
• A Fourier transform approach for improving the Levenshtein's lower bound on aperiodic correlation of binary sequences
• Lower bounds on the maximum cross-correlations of 2-D quasi-complementary array sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701271)