Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Binary Sequences With Merit Factor Greater Than<tex>$6.34$</tex>

From MaRDI portal
Publication:3546591
Jump to:navigation, search

DOI10.1109/TIT.2004.838341zbMath1267.94024MaRDI QIDQ3546591

Kwok-Kwong Stephen Choi, Jonathan Jedwab, Peter B. Borwein

Publication date: 21 December 2008

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


zbMATH Keywords

binary sequencesmerit factor


Mathematics Subject Classification ID

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


Related Items (7)

Improved lower bound for the Mahler measure of the Fekete polynomials ⋮ Littlewood polynomials with small \(L^4\) norm ⋮ A curious invariance property of certain perfect Legendre arrays: stirring without mixing ⋮ Families of multi-level Legendre-like arrays ⋮ Recent Progress in the Study of Polynomials with Constrained Coefficients ⋮ On Newman and Littlewood polynomials with a prescribed number of zeros inside the unit disk ⋮ The Perfect Binary Sequence of Period 4 for Low Periodic and Aperiodic Autocorrelations







This page was built for publication: Binary Sequences With Merit Factor Greater Than&lt;tex&gt;$6.34$&lt;/tex&gt;

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3546591&oldid=16927799"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 01:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki