Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
95
Voted
AAECC
2006
Springer
100
views
Algorithms
»
more
AAECC 2006
»
The Merit Factor Problem for Binary Sequences
15 years 8 months ago
Download
www.cecm.sfu.ca
Tom Høholdt
Real-time Traffic
AAECC 2006
|
Algorithms
|
claim paper
Related Content
»
A Survey of the Merit Factor Problem for Binary Sequences
»
Univariate and Multivariate Merit Factors
»
Merit Factors and Morse Sequences
»
Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation
»
Perfect and Almost Perfect Sequences
»
Greedy colorings for the binary paintshop problem
»
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
»
Online PassiveAggressive Algorithms
»
The decimationHadamard transform of twolevel autocorrelation sequences
more »
Post Info
More Details (n/a)
Added
13 Jun 2010
Updated
13 Jun 2010
Type
Conference
Year
2006
Where
AAECC
Authors
Tom Høholdt
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision