A discrete theory of search. I
A discrete theory of search. II
A generalized residual information measure and its properties.
A sampling theorem associated with boundary-value problems with not necessarily simple eigenvalues.
Alphabet-oriented and user-oriented source coding theories
Asymptotic equipartition properties for simple hierarchical and networked structures
We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large n, a networked data structure consisting of n units connected by an average number of links of order n / log n can be coded by about H × n bits, where H is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical...
Asymptotic equipartition properties for simple hierarchical and networked structures
We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large n, a networked data structure consisting of n units connected by an average number of links of order n / log n can be coded by about H × n bits, where H is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical...
Channels with additive asymptotically mean stationary noise
Coding theorems on generalized cost measure.
Continuity and quantization of channels with infinite alphabets
Entropy at a weight-per-symbol and embeddings of Markov chains.
Epsilon-rates, epsilon-quantiles, and group coding theorems for finitely additive information sources
Generalized Entropies in Coding Theory.
Heterogeneous questionnaires and Rényi's entropy
Information flows, graphs and their guessing numbers.
On a coding theorem connected with ‘useful’ entropy of order and type
On a generalization of Shannon's random cipher result
On capacity regions of discrete asynchronous multiple access channels
A general formalization is given for asynchronous multiple access channels which admits different assumptions on delays. This general framework allows the analysis of so far unexplored models leading to new interesting capacity regions. The main result is the single letter characterization of the capacity region in case of 3 senders, 2 synchronous with each other and the third not synchronous with them.
On coding theorem connected with “useful” entropy of order-.
On kissing numbers in dimensions 32 to 128.