Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The merit factor problem

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

DOI10.1017/CBO9780511721274.006zbMATH Open1266.11050MaRDI QIDQ3166369FDOQ3166369


Authors: Ron Ferguson, Joshua Knauer, Peter Borwein Edit this on Wikidata


Publication date: 11 October 2012

Published in: Number Theory and Polynomials (Search for Journal in Brave)





Recommendations

  • A Survey of the Merit Factor Problem for Binary Sequences
  • Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
  • Advances in the merit factor problem for binary sequences
  • Publication:4934416
  • The merit factor of binary sequences related to difference sets


zbMATH Keywords

autocorrelationpolynomialsflatnessmerit factorInteger sequences


Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Special sequences and polynomials (11B83) Calculation of integer sequences (11Y55)



Cited In (2)

  • Exhaustive Search for Optimal Minimum Peak Sidelobe Binary Sequences up to Length 80
  • Merit factors of polynomials derived from difference sets





This page was built for publication: The merit factor problem

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3166369&oldid=16272840"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 21:55. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki