Expected values for the rational complexity of finite binary sequences

DOI10.1007/S10623-009-9331-XMaRDI QIDQ2380400zbMATH OpenOpenAlexFDO

Authors Tian Tian, Wenfeng Qi

Publication date 26 March 2010

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

Full work available at URL https://doi.org/10.1007/s10623-009-9331-x

Mathematics Subject Classification ID

Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Sequences (mod (m)) (11B50)

Recommendations

• On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences
• Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences
• Rational complexity of binary sequences, F\(\mathbb{Q}\)SRs, and pseudo-ultrametric continued fractions in \(\mathbb{R}\)
• On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences
• Study of 2-adic complexity of a class of binary sequences with optimal autocorrelation values

Cites work

• scientific article; zbMATH DE number 1030997 (Why is no real title available?)
• 2-Adic shift registers
• Approximate formulas for some functions of prime numbers
• Feedback shift registers, 2-adic span, and combiners with memory
• On the $2$-Adic Complexity and the $k$-Error $2$-Adic Complexity of Periodic Binary Sequences

Cited in

(4)

• Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences
• Rational complexity of binary sequences, F\(\mathbb{Q}\)SRs, and pseudo-ultrametric continued fractions in \(\mathbb{R}\)
• Expected π-Adic Security Measures of Sequences
• The distribution of condition numbers of rational data of bounded bit length

This page was built for publication: Expected values for the rational complexity of finite binary sequences

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