On the Construction of Binary Sequence Families With Low Correlation and Large Sizes

DOI10.1109/TIT.2012.2219691MaRDI QIDQ2989428zbMATHOpenAlexFDO

Authors Udaya Parampalli, Xiaohu Tang, Serdar Boztaş

Publication date 8 June 2017

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

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

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• New Constructions of Large Binary Sequences Family with Low Correlation
• A new binary sequence family with low correlation and large size
• New families of binary sequences with low correlation
• New $M$-Ary Sequence Families With Low Correlation and Large Size
• New construction for families of binary sequences with optimal correlation properties
• Four Families of Binary Sequences with Low Correlation and Large Linear Complexity
• Families of \(p\)-ary sequences with low correlation and large linear complexity
• Two families of low-correlated binary sequences
• Large families of sequences with near-optimal correlations and large linear span
• Constructing Binary Sequences With Good Correlation Properties: An Efficient Analytical-Computational Interplay

Cited in

(5)

• Families of Pseudorandom Binary Sequences with Low Cross-Correlation Measure
• Tight bounds for the subspace sketch problem with applications
• Large families of sequences for CDMA, frequency hopping, and UWB
• Families of \(p\)-ary sequences with low correlation and large linear complexity
• New construction for families of binary sequences with optimal correlation properties

This page was built for publication: On the Construction of Binary Sequence Families With Low Correlation and Large Sizes

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