Construction of Even Length Binary Sequences With Asymptotic Merit Factor 6

DOI10.1109/TIT.2007.913421zbMATH Open1311.94064OpenAlexW1606855198MaRDI QIDQ3604637FDOQ3604637

Authors: Tingyao Xiong, J. I. Hall 

Publication date: 24 February 2009

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

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

Recommendations

• Binary Sequences With Merit Factor<tex>$≫ 6.3$</tex>
• The merit factor of binary sequence families constructed from \(m\)-sequences
• Binary Sequences With Merit Factor Greater Than<tex>$6.34$</tex>
• Advances in the merit factor problem for binary sequences
• Two binary sequence families with large merit factor

Mathematics Subject Classification ID

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

Cited In (7)

• A trace representation of binary Jacobi sequences
• The merit factor of binary sequence families constructed from \(m\)-sequences
• Efficient Optimization of the Merit Factor of Long Binary Sequences
• Title not available (Why is that?)
• Binary Sequences With Merit Factor<tex>$≫ 6.3$</tex>
• The merit factor of Legendre sequences (Corresp.)
• Binary Sequences With Merit Factor Greater Than<tex>$6.34$</tex>

This page was built for publication: Construction of Even Length Binary Sequences With Asymptotic Merit Factor $6$

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