Optimal sets of binary sequences

MaRDI QIDQ1389287zbMATH OpenFDO

Authors B. Zh. Kamaletdinov

Publication date 16 July 1998

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

binary sequencespacking bounds

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Binary sequences with optimal autocorrelation
• An optimal ensemble of binary sequences based on the union of the ensembles of Kasami and bent-function sequences
• New construction for families of binary sequences with optimal correlation properties

Cited in

(10)

• An optimal ensemble of binary sequences based on the union of the ensembles of Kasami and bent-function sequences
• Large families of sequences for CDMA, frequency hopping, and UWB
• Recursion polynomials of unfolded sequences
• scientific article; zbMATH DE number 6379409 (Why is no real title available?)
• scientific article; zbMATH DE number 4123670 (Why is no real title available?)
• scientific article; zbMATH DE number 1972845 (Why is no real title available?)
• A New Search for Optimal Binary Arrays with Minimum Peak Sidelobe Levels
• On finding minimal, maximal, and consistent sequences over a binary alphabet
• Minimum degree and density of binary sequences
• Compact symmetrical binary codes for system identification

This page was built for publication: Optimal sets of binary sequences

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