Keywords
Sequence (biology)Word (group theory)Directed acyclic graphShift registerComputer scienceTopological sortingLinear feedback shift registerAlgorithmGraphNonlinear systemDirected graphArithmeticTheoretical computer scienceMathematics
Affiliated Institutions
Related Publications
Free energy minimisation algorithmfor decoding and cryptanalysis
An algorithm is derived for inferring a binary vector s given noisy observations of As modulo 2, where A is a binary matrix. The binary vector is replaced by a vector of probabi...
Efficient and portable combined random number generators
In this paper we present an efficient way to combine two or more Multiplicative Linear Congruential Generators (MLCGs) and propose several new generators. The individual MLCGs, ...
The context-tree weighting method: basic properties
Describes a sequential universal data compression procedure for binary tree sources that performs the "double mixture." Using a context tree, this method weights in an efficient...
Publication Info
- Year
- 2006
- Type
- book-chapter
- Pages
- 318-326
- Citations
- 8
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
8
OpenAlex
Cite This
Cees J. A. Jansen,
D.E. Boekee
(2006).
On the significance of the directed acyclic word graph in cryptology.
Lecture notes in computer science
, 318-326.
https://doi.org/10.1007/bfb0030372
Identifiers
- DOI
- 10.1007/bfb0030372