A characterization of separable utility functions
A comparison of three optimality criteria for observation channels
A discrete theory of search. I
A functional equation and its application to information theory
A generalized coding problem for discrete information sources
A local structure of stationary perfectly noiseless codes between stationary non-ergodic sources. I. General considerations
A mixed theory of information. I : symmetric, recursive and measurable entropies of randomized systems of events
A *-mixing convergence theorem for convex set valued processes.
A modification of the Whittaker-Kotelnikov-Shannon sampling series.
A note on characterizations of entropies
A possibilistic view on set and multiset comparison
A refinement of an inequality from information theory.
A representation theorem for entropies with the branching property.
A strong limit theorem for functions of continuous random variables and an extension of the Shannon-McMillan theorem.
About optimum signalling of information
Access structures for finding characteristic-dependent linear rank inequalities
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
An application of a functional equation to information theory
An axiomatic characterization of generalized directed-divergence
Application des mathématiques polonaises et des capacités à l'étude de l'information sans probabilité