Maximum-Order Complexity and 2-Adic Complexity

Chen, Zhiru; Chen, Zhixiong; Obrovsky, Jakob; Winterhof, Arne

doi:10.1109/tit.2024.3405946

IEEE Trans. Inform. Theory

2024

DOI: 10.1109/tit.2024.3405946

|View full text |Cite

Maximum-Order Complexity and 2-Adic Complexity

Zhiru Chen,

Zhixiong Chen,

Jakob Obrovsky

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

A Survey on Complexity Measures for Pseudo-Random Sequences

2024

Cryptography

View full text Add to dashboard Cite

Since the introduction of the Kolmogorov complexity of binary sequences in the 1960s, there have been significant advancements on the topic of complexity measures for randomness assessment, which are of fundamental importance in theoretical computer science and of practical interest in cryptography. This survey reviews notable research from the past four decades on the linear, quadratic and maximum-order complexities of pseudo-random sequences, and their relations with Lempel–Ziv complexity, expansion complexity, 2-adic complexity and correlation measures.

show abstract

A Survey on Complexity Measures for Pseudo-Random Sequences

2024

Cryptography

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Maximum-Order Complexity and 2-Adic Complexity

Cited by 1 publication

References 35 publications

A Survey on Complexity Measures for Pseudo-Random Sequences

A Survey on Complexity Measures for Pseudo-Random Sequences

Contact Info

Product

Resources

About