Efficient Optimization of the Merit Factor of Long Binary Sequences

DOI10.1109/TIT.2011.2164778MaRDI QIDQ5272225zbMATH OpenOpenAlexWikidataFDO

Authors John Michael Baden

Publication date 12 July 2017

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

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

Mathematics Subject Classification ID

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

Recommendations

• Advances in the merit factor problem for binary sequences
• Optimizing the aperiodic merit factor of binary arrays
• A Survey of the Merit Factor Problem for Binary Sequences
• scientific article; zbMATH DE number 1390146
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Two binary sequence families with large merit factor
• scientific article; zbMATH DE number 721896
• The merit factor of binary sequence families constructed from m-sequences
• String Processing and Information Retrieval
• Construction of Even Length Binary Sequences With Asymptotic Merit Factor 6

Cited in

(3)

• Optimizing the aperiodic merit factor of binary arrays
• A Survey of the Merit Factor Problem for Binary Sequences
• Sequences with small correlation

This page was built for publication: Efficient Optimization of the Merit Factor of Long Binary Sequences

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