{"paper":{"title":"On error linear complexity of new generalized cyclotomic binary sequences of period $p^2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Chenhuang Wu, Chunxiang Xu, Pinhui Ke, Zhixiong Chen","submitted_at":"2017-11-16T12:38:48Z","abstract_excerpt":"We consider the $k$-error linear complexity of a new binary sequence of period $p^2$, proposed in the recent paper \"New generalized cyclotomic binary sequences of period $p^2$\", by Z. Xiao et al., who calculated the linear complexity of the sequences (Designs, Codes and Cryptography, 2017, https://doi.org/10.1007/s10623-017-0408-7). More exactly, we determine the values of $k$-error linear complexity over $\\mathbb{F}_2$ for almost $k>0$ in terms of the theory of Fermat quotients. Results indicate that such sequences have good stability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06063","kind":"arxiv","version":4},"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"}