On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\)

DOI10.1007/s10623-012-9610-9zbMath1277.11113OpenAlexW2046715444MaRDI QIDQ1949238

Pinhui Ke, Shengyuan Zhang, Jie Zhang

Publication date: 6 May 2013

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-012-9610-9

zbMATH Keywords

binary sequenceslinear complexityautocorrelationbalancegeneralized cyclotomy

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Sequences (mod (m)) (11B50)

Related Items (12)

Linear Complexity of New q-ary Generalized Cyclotomic Sequences of Period $$2p^n$$ ⋮ New generalized cyclotomic binary sequences of period \(p^2\) ⋮ Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation ⋮ A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity ⋮ The linear complexity of generalized cyclotomic binary sequences of period \(p^n\) ⋮ On the linear complexity and autocorrelation of generalized cyclotomic binary sequences with period \(4p^n \) ⋮ Linear complexity of generalized cyclotomic sequences with period \(p^nq^m\) ⋮ 2-Adic Complexity of Two Classes of Generalized Cyclotomic Binary Sequences ⋮ The linear complexity of a class of binary sequences with period \(2p\) ⋮ Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\) ⋮ The linear complexity of generalized cyclotomic sequences with period \(2p^n\) ⋮ Linear complexity of generalized cyclotomic sequences of period \(2p^m\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
• Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
• Binary sequences with optimal autocorrelation
• On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
• Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/
• Linear Complexity of Some Generalized Cyclotomic Sequences
• Linear Complexity and Autocorrelation of Prime Cube Sequences
• Shift-register synthesis and BCH decoding

This page was built for publication: On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\)