A discrete theory of search. I
Page 1 Next
Displaying 1 – 20 of 36
A discrete theory of search. II
Igor Vajda (1971)
Aplikace matematiky
A generalized residual information measure and its properties.
Baig, M.A.K., Dar, Javid Gani (2009)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
A sampling theorem associated with boundary-value problems with not necessarily simple eigenvalues.
Annaby, Mahmoud H., Hassan, Hassan A. (1998)
International Journal of Mathematics and Mathematical Sciences
Alphabet-oriented and user-oriented source coding theories
Igor Vajda (1987)
Kybernetika
Asymptotic equipartition properties for simple hierarchical and networked structures
Kwabena Doku-Amponsah (2012)
ESAIM: Probability and Statistics
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
Kwabena Doku-Amponsah (2012)
ESAIM: Probability and Statistics
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
Štefan Šujan (1981)
Kybernetika
Coding theorems on generalized cost measure.
Dar, Rayees Ahmad, Baig, M.A.K. (2008)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Continuity and quantization of channels with infinite alphabets
Štefan Šujan (1981)
Kybernetika
Entropy at a weight-per-symbol and embeddings of Markov chains.
Brian Marcus, Selim Tuncel (1990)
Inventiones mathematicae
Epsilon-rates, epsilon-quantiles, and group coding theorems for finitely additive information sources
Štefan Šujan (1980)
Kybernetika
Generalized Entropies in Coding Theory.
P.N. Rathie (1972)
Metrika
Heterogeneous questionnaires and Rényi's entropy
Asha Garg (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Information flows, graphs and their guessing numbers.
Riis, Søren (2007)
The Electronic Journal of Combinatorics [electronic only]
On a coding theorem connected with ‘useful’ entropy of order and type
Priti Jain, R. K. Tuteja (1987)
Kybernetika
On a generalization of Shannon's random cipher result
Prasanna K. Sahoo (1986)
Kybernetika
On capacity regions of discrete asynchronous multiple access channels
Lóránt Farkas, Tamás Kói (2014)
Kybernetika
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-.
Jain, Priti, Tuteja, R.K. (1989)
International Journal of Mathematics and Mathematical Sciences
On kissing numbers in dimensions 32 to 128.
Edel, Yves, Rains, E.M., Sloane, N.J.A. (1998)
The Electronic Journal of Combinatorics [electronic only]
Currently displaying 1 – 20 of 36
Page 1 Next