An Approximate Distribution for the Maximum Order Complexity

被引：20
|
作者：
Erdmann D. [1 ]
Murphy S. [2 ]
机构：
[1] Applied Decision Analysis Inc., Menlo Park, CA 94025
[2] Information Security Group, Royal Holloway, University of London, Egham
来源：
Designs, Codes and Cryptography | 1997年 / 10卷 / 3期
关键词：
Binary sequence; Feedback shift register; Maximum order complexity; Stream cipher;
D O I：
10.1023/A:1008295603824
中图分类号：
学科分类号：
摘要：
In this paper we give an approximate probability distribution for the maximum order complexity of a random binary sequence. This enables the development of statistical tests based on maximum order complexity for the testing of a binary sequence generator. These tests are analogous to those based on linear complexity.
引用
收藏
页码：325 / 339
页数：14
相关论文
共 50 条
  • [1] Sublinear Time Algorithms and Complexity of Approximate Maximum Matching
    Behnezhad, Soheil
    Roghani, Mohammad
    Rubinstein, Aviad
    [J]. PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 267 - 280
  • [2] Low Complexity Approximate Maximum Throughput Scheduling for LTE
    Schwarz, Stefan
    Mehlfuehrer, Christian
    Rupp, Markus
    [J]. 2010 CONFERENCE RECORD OF THE FORTY FOURTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS (ASILOMAR), 2010, : 1563 - 1569
  • [3] THE MAXIMUM ORDER COMPLEXITY OF SEQUENCE ENSEMBLES
    JANSEN, CJA
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 547 : 153 - 159
  • [4] Maximum-Order Complexity and 2-Adic Complexity
    Chen, Zhiru
    Chen, Zhixiong
    Obrovsky, Jakob
    Winterhof, Arne
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (08) : 6060 - 6067
  • [5] Approximate maximum likelihood estimation of the Bingham distribution
    Bee, Marco
    Benedetti, Roberto
    Espa, Giuseppe
    [J]. COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2017, 108 : 84 - 96
  • [6] Communication complexity of approximate maximum matching in the message-passing model
    Huang, Zengfeng
    Radunovic, Bozidar
    Vojnovic, Milan
    Zhang, Qin
    [J]. DISTRIBUTED COMPUTING, 2020, 33 (06) : 515 - 531
  • [7] Communication complexity of approximate maximum matching in the message-passing model
    Zengfeng Huang
    Bozidar Radunovic
    Milan Vojnovic
    Qin Zhang
    [J]. Distributed Computing, 2020, 33 : 515 - 531
  • [8] The approximate distribution of the maximum of a smoothed Poisson random field
    Rabinowitz, D
    Siegmund, D
    [J]. STATISTICA SINICA, 1997, 7 (01) : 167 - 180
  • [9] Correlation measure, linear complexity and maximum order complexity for families of binary sequences
    Chen, Zhixiong
    Gomez, Ana, I
    Gomez-Perez, Domingo
    Tirkel, Andrew
    [J]. FINITE FIELDS AND THEIR APPLICATIONS, 2022, 78
  • [10] Complexity and order in approximate quantum error-correcting codes
    Yi, Jinmin
    Ye, Weicheng
    Gottesman, Daniel
    Liu, Zi-Wen
    [J]. NATURE PHYSICS, 2024,
12345