{"paper":{"title":"Modifications on Character Sequences and Construction of Large Even Length Binary Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jonathan I. Hall, Tingyao Xiong","submitted_at":"2014-07-11T14:50:47Z","abstract_excerpt":"It has been noticed that all the known binary sequences having the asymptotic merit factor $\\ge 6$ are the modifications to the real primitive characters. In this paper, we give a new modification of the character sequences at length $N=p_1p_2\\dots p_r$, where $p_i$'s are distinct odd primes and $r$ is finite. Based on these new modifications, for $N=p_1p_2\\dots p_r$ with $p_i$'s distinct odd primes, we can construct a binary sequence of length $2N$ with asymptotic merit factor $6.0$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3178","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}