Keyword

binary sequences

Description: Binary sequences are ordered lists of elements drawn from a two-symbol set, commonly represented by the digits zero and one in mathematics and computing.

Primary topic: Coding theory and cryptography (46%)

Wikidata ID: wiki/Q415568

OpenAlex ID: keywords/binary-sequences

The Regression Analysis of Binary Sequences

1958 · D. R. Cox · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 2,893

Complementary series

1961 · M. Golay · IEEE Transactions on Information Theory · 1,533

The definition of random sequences

1966 · Per Martin-Löf · Information and Control · 1,221

PDF

Synthesis of low-peak-factor signals and binary sequences with low autocorrelation (Corresp.)

1970 · M. Schroeder · IEEE Transactions on Information Theory · 741

Pseudo-random sequences and arrays

1976 · F.J. MacWilliams, N.J.A. Sloane · Proceedings of the IEEE · 732

A novel bit-level image encryption algorithm based on chaotic maps

2015 · Lu Xu, Zhi Li, et al. · Optics and Lasers in Engineering · 565

Enumerative source encoding

1973 · T. Cover · IEEE Transactions on Information Theory · 504

Random sequence generation by cellular automata

1986 · Stephen Wolfram · Advances in Applied Mathematics · 494

PDF

Mutual information functions versus correlation functions

1990 · Wentian Li · Journal of Statistical Physics · 438

A Survey of Full Length Nonlinear Shift Register Cycle Algorithms

1982 · Harold Fredricksen · SIAM Review · 434

Compression with side information using turbo codes

2003 · A. Aaron, B. Girod · DCC · 399

On the concept of a random sequence

1940 · Alonzo Church · Bulletin of the American Mathematical Society · 392

PDF

Universal prediction of individual sequences

1992 · M. Feder, N. Merhav, et al. · IEEE Transactions on Information Theory · 374

Binary codes with specified minimum distance

1960 · M. Plotkin · IEEE Transactions on Information Theory · 364

The Ubiquitous Prouhet-Thue-Morse Sequence

1999 · Jean-Paul Allouche, Jeffrey Shallit · Springer eBooks · 354

Hierarchies of memory limited computations

1965 · R. E. Stearns, J. Hartmanis, et al. · Annual Symposium on Switching Circuit Theory and Logical Design (SWCT) · 353

Class of binary sequences with zero correlationzone

1999 · P.Z. Fan, N. Suehiro, et al. · Electronics Letters · 343

Shift Register Sequences

2020 · Dirk Hachenberger, Dieter Jungnickel · Algorithms and computation in mathematics · 341

The Regression Analysis of Binary Sequences

1959 · D. R. Cox · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 322

Stream Ciphers and Number Theory

1998 · North-Holland mathematical library · 287

Spam Filtering Using Statistical Data Compression Models

2006 · Andrej Bratko, Bogdan Filipič, et al. · 245

Efficient Storage and Retrieval by Content and Address of Static Files

1974 · Peter Elias · Journal of the ACM · 241

PDF

Synthesis of power efficient multitone signals with flat amplitude spectrum

1991 · B.M. Popovic · IEEE Transactions on Communications · 233

Memory bounds for recognition of context-free and context-sensitive languages

1965 · P. M. Lewis, R. E. Stearns, et al. · Annual Symposium on Switching Circuit Theory and Logical Design (SWCT) · 231

Generation of random series in two-person strictly competitive games.

1992 · Amnon Rapoport, David V. Budescu · Journal of Experimental Psychology General · 220

Works count: 3,307

Citation count: 40,750