A further study of the linear complexity of new binary cyclotomic sequence of length p^r

DOI10.1007/S00200-018-0368-9MaRDI QIDQ2002148zbMATHOpenAlexFDO

Authors Zhifan Ye, Pinhui Ke, Chenhuang Wu

Publication date 11 July 2019

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1712.08886

zbMATH Keywords

linear complexitybinary sequencegeneralized cyclotomyEuler quotient

Mathematics Subject Classification ID

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

Abstract: Recently, a conjecture on the linear complexity of a new class of generalized cyclotomic binary sequences of period $p^r$ was proposed by Z. Xiao et al. (Des. Codes Cryptogr., DOI 10.1007/s10623-017-0408-7). Later, for the case $f$ being the form $2^r$ with $rge1$, Vladimir Edemskiy proved the conjecture (arXiv:1712.03947). In this paper, under the assumption of $$ and $gcd(fracp-1{mord}_p(2),f)=1$, the conjecture proposed by Z. Xiao et al. is proved for a general $f$ by using the Euler quotient. Actually, a generic construction of $p^r$-periodic binary sequence based on the generalized cyclotomy is introduced in this paper, which admits a flexible support set and includes Xiao's construction as a special case, and then an efficient method to compute the linear complexity of the sequence by the generic construction is presented, based on which the conjecture proposed by Z. Xiao et al. could be easily proved under the aforementioned assumption.

Recommendations

• The linear complexity of generalized cyclotomic binary sequences of period \(p^n\)
• Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
• Linear complexity of generalized cyclotomic binary sequences of order \(2d\) and length \(2p^m\)
• Linear complexity of new \(q\)-ary generalized cyclotomic sequences of period \(2p^n\)
• Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)

Cites work

• scientific article; zbMATH DE number 4062996 (Why is no real title available?)
• scientific article; zbMATH DE number 1182117 (Why is no real title available?)
• scientific article; zbMATH DE number 2238187 (Why is no real title available?)
• A Wieferich prime search up to \(6.7 \times 10^{15}\)
• About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
• An extension of binary threshold sequences from Fermat quotients
• Finding an internal state of RC4 stream cipher
• New generalized cyclotomic binary sequences of period \(p^2\)
• On the k-error linear complexity of binary sequences derived from polynomial quotients
• Optimal Frequency Hopping Sequences of Odd Length
• Shift-register synthesis and BCH decoding
• Trace representation of pseudorandom binary sequences derived from Euler quotients

Cited in

(9)

• Linear complexity of new \(q\)-ary generalized cyclotomic sequences of period \(2p^n\)
• Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
• On the properties of generalized cyclotomic binary sequences of period \(2p^m\)
• The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods \(p^n\) and \(2p^n\)
• Proof of Rueppel's linear complexity conjecture (Corresp.)
• Linear complexity of a new class of quaternary generalized cyclotomic sequence with period \(2 p^m\)
• The linear complexity of generalized cyclotomic binary sequences of period \(p^n\)
• New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity
• Linear complexity of generalized cyclotomic sequences with period \(p^nq^m\)

This page was built for publication: A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\)

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