Kanaya, 1997 - Google Patents
A chaos model of finite-order Markov sources and arithmetic codingKanaya, 1997
- Document ID
- 17877257908931997854
- Author
- Kanaya F
- Publication year
- Publication venue
- Proceedings of IEEE International Symposium on Information Theory
External Links
Snippet
A Chaos Model Of Finite-order Markov Sources And Arithmetic Coding - Information Theory.
1997. Proceedings., 1997 IEEE Internati Page 1 ISlT 1997. Ulm. Germany, June 29 - July 4 A
Chaos Model of Finite-Order Markov Sources and Arithmetic Coding Fumio Kanaya Department …
- 230000001131 transforming 0 abstract description 14
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/58—Random or pseudo-random number generators
- G06F7/588—Random number generators, i.e. based on natural stochastic processes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/58—Random or pseudo-random number generators
- G06F7/582—Pseudo-random number generators
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8320557B2 (en) | Cryptographic system including a mixed radix number generator with chosen statistical artifacts | |
EP2000900B1 (en) | Extending a repetition period of a random sequence | |
Nisan et al. | Randomness is linear in space | |
US7995749B2 (en) | Cryptographic system configured for extending a repetition period of a random sequence | |
Juels et al. | How to turn loaded dice into fair coins | |
JP3696209B2 (en) | Seed generation circuit, random number generation circuit, semiconductor integrated circuit, IC card and information terminal device | |
Vitulyova et al. | New application of non-binary Galois fields Fourier transform: Digital analog of convolution theorem | |
Johnson | The NP-completeness column | |
Markovski et al. | Unbiased random sequences from quasigroup string transformations | |
Kanaya | A chaos model of finite-order Markov sources and arithmetic coding | |
Suneel | Cryptographic pseudo-random sequences from the chaotic Hénon map | |
US6745219B1 (en) | Arithmetic unit using stochastic data processing | |
US20040054703A1 (en) | Method and device for generating a pseudo-random sequence using a discrete logarithm | |
Petriu et al. | Applications of random-pulse machine concept to neural network design | |
Jaynes | Note on unique decipherability | |
Kohda et al. | Kalman's recognition of chaotic dynamics in designing Markov information sources | |
Ziv | The Universal LZ77 Compression Algorithm Is Essentially Optimal for Individual Finite-Length $ N $-Blocks | |
Muramatsu et al. | On the problem of generating mutually independent random sequences | |
US7293053B2 (en) | Digital random generator based on an arithmetic compressor | |
Nekrutkin | On the complexity of binary floating point pseudorandom generation | |
Cox et al. | How efficiently do three pointlike particles sample phase space? | |
Anoulova et al. | Six ways of looking at Burtin's lemma | |
Ryabko | A pseudo-random generator whose output is a normal sequence | |
Fisher et al. | Generation of finite inductive, pseudo random, binary sequences | |
Chan et al. | The CHNN nonlinear combination generator |