Linear Complexity Versus Pseudorandomness: On Beth and Dai’s Result

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-48000-6_23
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Pseudorandomness and Combinatorial Constructions

English

Delone Sets With Finite Local Complexity: Linear Repetitivity Versus Positivity of Weights

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2012English

The Influence of Linear-Time Models on Complexity Theory

International Journal of Recent Technology and Engineering
EngineeringManagement of TechnologyInnovation
2019English

On the Sample Complexity of the Linear Quadratic Regulator

Foundations of Computational Mathematics
MathematicsComputational MathematicsApplied MathematicsAnalysisComputational Theory
2019English

Complexity Versus Conflict in Communication

2012English

On the Linear Complexity of Hall's Sextic Residue Sequences

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2001English

Complexity of Solving Tropical Linear Systems

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2013English

Cube Theory and K-Error Linear Complexity Profile

International Journal of Security and its Applications
Computer Science
2016English

On the Linear Complexity of Products of Shift-Register Sequences

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy