UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Information-Theoretic Approach to Estimating the Capacity of Distributed Memory Systems

Problems of information transmission, 2018-04, Vol.54 (2), p.191-198

Ryabko, B. Ya

2018

Volltextzugriff (PDF)

Classification by compression: Application of information-theory methods for the identification of themes of scientific texts

Automatic documentation and mathematical linguistics, 2017-06, Vol.51 (3), p.120-126

2017

Volltextzugriff (PDF)

Information-Theoretic method for classification of texts

Problems of information transmission, 2017-07, Vol.53 (3), p.294-304

2017

Volltextzugriff (PDF)

The Vernam cipher is robust to small deviations from randomness

Problems of information transmission, 2015, Vol.51 (1), p.82-86

Ryabko, B. Ya

2015

Volltextzugriff (PDF)

Experimental Study of the Accuracy of Compression-Based Forecasting Methods

Vestnik NSU. Series: Information Technologies, 2018, Vol.16 (3), p.145-158

2018

Volltextzugriff (PDF)

Time series prediction based on data compression methods

Problems of information transmission, 2016, Vol.52 (1), p.92-99

2016

Volltextzugriff (PDF)

Asymptotically optimal perfect steganographic systems

Problems of information transmission, 2009, Vol.45 (2), p.184-190

2009

Volltextzugriff (PDF)

Using information theory approach to randomness testing

Journal of statistical planning and inference, 2005-07, Vol.133 (1), p.95-110

2005

Volltextzugriff (PDF)

Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes

Problems of information transmission, 2007-12, Vol.43 (4), p.367-379

Ryabko, B. Ya

2007

Volltextzugriff (PDF)

Fast enumeration algorithm for words with given constraints on run lengths of ones

Problems of information transmission, 2010-12, Vol.46 (4), p.390-399

2010

Volltextzugriff (PDF)

A new test for randomness and its application to some cryptographic problems

Journal of statistical planning and inference, 2004-07, Vol.123 (2), p.365-376

2004

Volltextzugriff (PDF)

Applications of two-faced processes to pseudorandom number generation

Prikladnaya diskretnaya matematika. Prilozhenie, 2016-12 (9), p.68-70

Ryabko, B. Ya

2016

Volltextzugriff (PDF)

Using information theory approach to randomness testing

Journal of statistical planning and inference, 2005, Vol.133 (1), p.95-110

2005

Volltextzugriff (PDF)

Experimental investigation of forecasting methods based on data compression algorithms

Problems of information transmission, 2005-01, Vol.41 (1), p.65-69

2005

Volltextzugriff (PDF)

A new test for randomness and its application to some cryptographic problems

Journal of statistical planning and inference, 2004, Vol.123 (2), p.365-376

2004

Volltextzugriff (PDF)

“Book Stack” as a New Statistical Test for Random Numbers

Problems of information transmission, 2004-01, Vol.40 (1), p.66-71

2004

Volltextzugriff (PDF)

Fast coding of low-entropy sources

IEEE transactions on information theory, 1999-11, Vol.45 (7), p.2612-2615

1999

Volltextzugriff (PDF)

A New Type of Attacks on Block Ciphers

Problems of information transmission, 2005-10, Vol.41 (4), p.385-394

2005

Volltextzugriff (PDF)

Fast coding of sources with unknown statistics

IEEE International Symposium on Information Theory, 1993, 1993, p.57-57

Ryabko, B.Y.

1993

Volltextzugriff (PDF)

Fast and efficient coding of information sources

IEEE transactions on information theory, 1994-01, Vol.40 (1), p.96-99

Ryabko, B.Ya

1994

Volltextzugriff (PDF)

Fast and efficient coding of information sources

IEEE transactions on information theory, 1994, Vol.40 (1), p.96-99

RYABKO, B. YA

1994

Volltextzugriff (PDF)

An estimate of mean efficiency of search trees for arbitrary sets of binary words

Discrete mathematics and applications, 2002, Vol.12 (2), p.155-164

2002

Volltextzugriff (PDF)

A fast on-line adaptive code

IEEE transactions on information theory, 1992-07, Vol.38 (4), p.1400-1404

Ryabko, B.Y.

1992

Volltextzugriff (PDF)

Fast enumeration of combinatorial objects

Discrete mathematics and applications, 1998, Vol.8 (2), p.163-182

RYABKO, B. YA

1998

Volltextzugriff (PDF)

Experimental studies of the ability of ants to add and subtract small numbers

Neuroscience and behavioral physiology, 2000-03, Vol.30 (2), p.123-130

2000

Volltextzugriff (PDF)

1 – 25 von 34

Menü

Weitere Dienste

Einstellungen

Information-Theoretic Approach to Estimating the Capacity of Distributed Memory Systems

Classification by compression: Application of information-theory methods for the identification of themes of scientific texts

Information-Theoretic method for classification of texts

The Vernam cipher is robust to small deviations from randomness

Experimental Study of the Accuracy of Compression-Based Forecasting Methods

Time series prediction based on data compression methods

Asymptotically optimal perfect steganographic systems

Using information theory approach to randomness testing

Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes

Fast enumeration algorithm for words with given constraints on run lengths of ones

A new test for randomness and its application to some cryptographic problems

Applications of two-faced processes to pseudorandom number generation

Using information theory approach to randomness testing

Experimental investigation of forecasting methods based on data compression algorithms

A new test for randomness and its application to some cryptographic problems

“Book Stack” as a New Statistical Test for Random Numbers

Fast coding of low-entropy sources

A New Type of Attacks on Block Ciphers

Fast coding of sources with unknown statistics

Fast and efficient coding of information sources

Fast and efficient coding of information sources

An estimate of mean efficiency of search trees for arbitrary sets of binary words

A fast on-line adaptive code

Fast enumeration of combinatorial objects

Experimental studies of the ability of ants to add and subtract small numbers

Suchergebnisse filtern