Kieffer, John C.
(as bibtex)
Elsewhere:
[math people]
[google]
[google scholar]
Articles (12)

Kieffer, John C..
Comparison of two optimum rates for noiseless encoding of a nonstationary information source.
IEEE Transactions on Information Theory
1990.
36:256261

Kieffer, John C..
An ergodic theorem for constrained sequences of
functions.
Bulletin of the American Mathematical Society
1989.
21:249254

Kieffer, John C..
Finitestate adaptive block to variablelength noiseless coding of a nonstationary information source.
IEEE Transactions on Information Theory
1989.
35:12591263

Kieffer, John C..
Fixedrate encoding of nonstationary information sources.
IEEE Transactions on Information Theory
1987.
33:651655

Kieffer, John C..
A simple development of the Thouvenot relative isomorphism theory.
The Annals of Probability
1984.
12:204211

Kieffer, John C..
Some topologies on the set of discrete stationary channels..
Pacific Journal of Mathematics
1983.
105:359385

Kieffer, John C., Rahe, Maurice.
Selecting universal partitions in ergodic theory.
The Annals of Probability
1981.
9:705709

Kieffer, John C..
On coding a stationary process to achieve a given marginal distribution.
The Annals of Probability
1980.
8:131141

Kieffer, John C..
Some universal noiseless multiterminal source coding theorems.
Information and Control
1980.
46:93107

Kieffer, John C..
On the transmission of Bernoulli sources over stationary channels.
The Annals of Probability
1980.
8:942961

Kieffer, John C..
Note: Correction to "A Counterexample to Perez's Generalization of the ShannonMcMillan Theorem".
The Annals of Probability
1976.
4:153154

Kieffer, John C..
On the minimum number of fixed length sequences with fixed total probability.
The Annals of Probability
1976.
4:335337