Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

DOI10.1007/11617983zbMATH Open1125.94008OpenAlexW4376524422MaRDI QIDQ5898577FDOQ5898577

Authors: Tom Høholdt 

Publication date: 12 February 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11617983

Recommendations

• Publication:4934416
• The merit factor of binary sequences related to difference sets
• A Survey of the Merit Factor Problem for Binary Sequences
• Advances in the merit factor problem for binary sequences
• The merit factor of binary sequence families constructed from \(m\)-sequences

Mathematics Subject Classification ID

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

Cited In (12)

• Littlewood polynomials with small \(L^4\) norm
• Advances in the merit factor problem for binary sequences
• Title not available (Why is that?)
• The merit factor problem
• Efficient Optimization of the Merit Factor of Long Binary Sequences
• Optimizing the aperiodic merit factor of binary arrays
• Binary Sequences With Merit Factor Greater Than<tex>$6.34$</tex>
• Sequences with small correlation
• Determination of the merit factor of Legendre sequences
• Crosscorrelation of Rudin-Shapiro-like polynomials
• A Survey of the Merit Factor Problem for Binary Sequences
• Merit factors of polynomials derived from difference sets

This page was built for publication: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

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