A characterization of separable utility functions
Page 1 Next
Displaying 1 – 20 of 21
A comparison of three optimality criteria for observation channels
Igor Vajda, Petr Nedoma (1973)
Kybernetika
A discrete theory of search. I
Igor Vajda (1971)
Aplikace matematiky
A functional equation and its application to information theory
P. Kannappan, C. T. Ng (1974)
Annales Polonici Mathematici
A generalized coding problem for discrete information sources
Štefan Šujan (1977)
Kybernetika
A local structure of stationary perfectly noiseless codes between stationary non-ergodic sources. I. General considerations
Štefan Šujan (1982)
Kybernetika
A mixed theory of information. I : symmetric, recursive and measurable entropies of randomized systems of events
J. Aczél, Z. Daróczy (1978)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
A *-mixing convergence theorem for convex set valued processes.
de Korvin, A., Kleyle, R. (1987)
International Journal of Mathematics and Mathematical Sciences
A modification of the Whittaker-Kotelnikov-Shannon sampling series.
P.L. Butzer, R.L. Stens (1985)
Aequationes mathematicae
A note on characterizations of entropies
J. S. Chawla (1977)
Kybernetika
A possibilistic view on set and multiset comparison
Antoon Bronselaer, Axel Hallez, Guy De Tré (2009)
Control and Cybernetics
A refinement of an inequality from information theory.
Halliwell, Garry T., Mercer, Peter R. (2004)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
A representation theorem for entropies with the branching property.
B. Forte, W. Hughes (1989)
Aequationes mathematicae
A strong limit theorem for functions of continuous random variables and an extension of the Shannon-McMillan theorem.
Li, Gaorong, Chen, Shuang, Feng, Sanying (2008)
Journal of Applied Mathematics
About optimum signalling of information
Igor Vajda (1989)
Kybernetika
Access structures for finding characteristic-dependent linear rank inequalities
Victor Peña-Macias (2023)
Kybernetika
Determining information ratios of access structures is an important problem in secret sharing. Information inequalities and linear rank inequalities play an important role for proving bounds on these ratios. Characteristic-dependent linear rank inequalities are rank inequalities which are true over vector spaces with specific field characteristic. In this paper, using ideas of secret sharing, we show a theorem that produces characteristic-dependent linear rank inequalities. These inequalities are...
Alphabet-oriented and user-oriented source coding theories
Igor Vajda (1987)
Kybernetika
An application of a functional equation to information theory
P. Kannappan, P. N. Rathie (1972)
Annales Polonici Mathematici
An axiomatic characterization of generalized directed-divergence
Palaniappan Kannappan, Pushpa Narayan Rathie (1973)
Kybernetika
Application des mathématiques polonaises et des capacités à l'étude de l'information sans probabilité
Michèle Dehen (1969/1970)
Séminaire Choquet. Initiation à l'analyse
Currently displaying 1 – 20 of 21
Page 1 Next