Emeritus Professor John C. Kieffer Journal Publications
[78]
Zhang, J.; Yang, E.-H; Kieffer, J. C.
``A Universal Grammar-Based Code For Lossless Compression of Binary Trees.''
IEEE Trans. Inform. Theory
60 (2014), no. 3, 1373--1386.
[77]
Kieffer, J. C.
``A Catalog of Self-Affine Hierarchical Entropy Functions.''
Algorithms (Basel)
4 (2011), no. 4, 307--333.
[76]
Rokhani, F.; Kan, W.-C.; Kieffer, J. C.; Sobelman, G.
``Optimality of Bus-Invert Coding.''
IEEE Trans. Circuits Systems II: Express Briefs
55 (2008), no. 11, 1134--1138.
[75]
Kieffer, J. C.
``Epsilon-Capacity of Binary Symmetric Averaged Channels.''
IEEE Trans. Inform. Theory
53 (2007), no. 1, 288--303.
[74]
Vitthaladevuni, P.; Alouini, M.-S.; Kieffer, J. C.
``Exact BER Computation for Cross QAM Constellations*.''
IEEE Trans. Wireless Commun. 4 (2005), no. 6, 3039--3050.
[73]
Liao, Y.; Kieffer, J. C.
``A New High Rate Code Scheme
With Highly Parallel and Low Complexity Decoding Algorithm.''
IEEE Communications Letters
8 (2004), no. 6, 386--387.
[72]
Kieffer, J. C.; Szpankowski, W.; Yang, E.-H.
``Problems on
Sequences: Information Theory and Computer Science Interface.''
IEEE Trans. Inform. Theory
50 (2004), no. 7, 1385--1391.
[71]
Kieffer, J. C.; Yang, E.-H.
``Grammar-Based Lossless Universal Refinement Source Coding.''
IEEE Trans. Inform. Theory
50 (2004), no. 7, 1415--1424.
[70]
Peng, K.; Kieffer, J. C.
``Embedded Image Compression Based on Wavelet Pixel Classification and Sorting.''
IEEE Trans. Image Proc.
13 (2004), no. 8, 1011--1017.
[69]
Kieffer, J. C.; Yang, E.-H.
``Structured Grammar-Based Codes for Universal Lossless Data Compression.''
Communications in Information and Systems
2 (2002), no. 2, 29--52.
[68]
Yang, E.-H.; Kaltchenko, A.; Kieffer, J. C.
``Universal Lossless Data Compression With Side Information by Using a Conditional MPM Grammar Transform.''
IEEE Trans. Inform. Theory
47 (2001), no. 6, 2130--2150.
[67]
Yang, E.-H.; Kieffer, J. C.
``Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models.''
IEEE Trans. Inform. Theory
46 (2000), no. 3, 755--777.
[66]
Kieffer, J. C.; Yang, E.-H.
``Grammar-based codes: a new class of universal lossless source codes.''
IEEE Trans. Inform. Theory
46 (2000), no. 3, 737--754.
[65]
Kieffer, J. C.; Yang, E.-H.; Nelson, G. J.; Cosman, P.
``Universal lossless compression via multilevel pattern matching.''
IEEE Trans. Inform. Theory
46 (2000), no. 4, 1227--1245.
[64]
Yakowitz, S.; Györfi, L.; Kieffer, J. C.; Morvai, G.
``Strongly consistent nonparametric forecasting and regression for stationary ergodic sequences.''
J. Multivariate Anal.
71 (1999), no. 1, 24--41.
[63]
Yang, E.-H.; Kieffer, J. C.
``On the performance of data compression algorithms based upon string matching.''
IEEE Trans. Inform. Theory
44 (1998), no. 1, 47--65.
[62]
Yang, E.-H.; Kieffer, J. C.
``On the redundancy of the fixed-database Lempel-Ziv algorithm for phi-mixing sources.''
IEEE Trans. Inform. Theory
43 (1997), no. 4, 1101--1111.
[61]
Kieffer, J.; Yang, E.-H.
``Ergodic behavior of graph entropy.''
Electron. Res. Announc. Amer. Math. Soc.
3 (1997), 11--16.
[60]
Kieffer, J. C.; Yang, E.-H.
``Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity.''
IEEE Trans. Inform. Theory
42 (1996), no. 1, 29--39.
[59]
Yang, E.-H.; Kieffer, J. C.
``Simple universal lossy data compression
schemes derived from the Lempel-Ziv algorithm.''
IEEE Trans. Inform. Theory
42 (1996), no. 1, 239--246.
[58]
Kieffer, J. C.
``A survey of the theory of source coding with a fidelity criterion.''
IEEE Trans. Inform. Theory
39 (1993), no. 5, 1473--1490.
[57]
Kieffer, J. C.
``Strongly consistent code-based identification and order estimation for constrained finite-state model classes.''
IEEE Trans. Inform. Theory
39 (1993), no. 3, 893--902.
[56]
Kieffer, J. C.
``Sample converses in source coding theory.''
IEEE Trans. Inform. Theory
37 (1991), no. 2, 263--268.
[55]
Kieffer, J. C.
``Strong converses in source coding relative to a fidelity criterion.''
IEEE Trans. Inform. Theory
37 (1991), no. 2, 257--262.
[54]
Kieffer, J. C.
``Comparison of two optimum rates for noiseless encoding of a nonstationary information source.''
IEEE Trans. Inform. Theory
36 (1990), no. 2, 256--261.
[53]
Kieffer, J. C.
``Analysis of dc input response for a class of one-bit feedback encoders.''
IEEE Trans. Communications
38 (1990), no. 3, 337--340.
[52]
Kieffer, J. C.
``Finite-state adaptive block to variable-length noiseless coding of a nonstationary information source.''
IEEE Trans. Inform. Theory
35 (1989), no. 6, 1259--1263.
[51]
Kieffer, J. C.
``An ergodic theorem for constrained sequences of functions.''
Bull. Amer. Math. Soc. (N.S.)
21 (1989), no. 2, 249--254.
[50]
Kieffer, J. C.; Jahns, T. M.; Obuljen, V. A.
``New results on optimal entropy-constrained quantization.''
IEEE Trans. Inform. Theory
34 (1988), no. 5, part II, 1250--1258.
[49]
Kieffer, J. C.
``Fixed-rate encoding of nonstationary information sources.''
IEEE Trans. Inform. Theory
33 (1987), no. 5, 651--655.
[48]
Kieffer, J. C.
``A simple development of the Thouvenot relative isomorphism theory.''
Ann. Probab.
12 (1984), no. 1, 204--211.
[47]
Kieffer, J. C.; Dunham, J. G.
``On a type of stochastic stability for a class of encoding schemes.''
IEEE Trans. Inform. Theory
29 (1983), no. 6, 793--797.
[46]
Kieffer, J. C.
``On obtaining a stationary process isomorphic to a given process with a desired distribution.''
Monatsh. Math.
96 (1983), no. 3, 183--193.
[45]
Kieffer, J. C.
``Some topologies on the set of discrete stationary channels.''
Pacific J. Math.
105 (1983), no. 2, 359--385.
[44]
Kieffer, J. C.
``Uniqueness of locally optimal quantizer for log-concave density and convex error weighting function.''
IEEE Trans. Inform. Theory
29 (1983), no. 1, 42--47.
[43]
Kieffer, J. C.; Rahe, M.
``The pointwise ergodic theorem for transformations whose orbits contain or are contained in the orbits of a measure-preserving transformation.''
Canad. J. Math.
34 (1982), no. 6, 1303--1318.
[42]
Kieffer, J. C.
``A direct proof that VWB processes are closed in the d-bar metric.''
Israel J. Math.
41 (1982), no. 1-2, 154--160.
[41]
Kieffer, J. C.; Rahe, M.
``Finitely fixed implies loosely Bernoulli, a direct proof.''
Israel J. Math.
43 (1982), no. 2, 97--104.
[40]
Kieffer, J. C.
``Sliding-block coding for weakly continuous channels.''
IEEE Trans. Inform. Theory
28 (1982), no. 1, 2--10.
[39]
Kieffer, J. C.; Stanojević, Č. V.
``The Lebesgue integral as the almost sure limit of random Riemann sums.''
Proc. Amer. Math. Soc.
85 (1982), no. 3, 389--392.
[38]
Kieffer, J. C.
``Characterizations of d-bar total boundedness for classes of B-sources.''
IEEE Trans. Inform. Theory
28 (1982), no. 1, 26--35.
[37]
Kieffer, J. C.
``Stochastic stability for feedback quantization schemes.''
IEEE Trans. Inform. Theory
28 (1982), no. 2, 248--254.
[36]
Kieffer, J. C.
``Exponential rate of convergence for Lloyd's method I.''
IEEE Trans. Inform. Theory
28 (1982), no. 2, 205--210.
[35]
Kieffer, J. C.
``A method for proving multiterminal source coding theorems.''
IEEE Trans. Inform. Theory
27 (1981), no. 5, 565--570.
[34]
Kieffer, J. C.; Rahe, M.
``Selecting universal partitions in ergodic theory.''
Ann. Probab.
9 (1981), no. 4, 705--709.
[33]
Kieffer, J. C.
``Block coding for weakly continuous channels.''
IEEE Trans. Inform. Theory
27 (1981), no. 6, 721--727.
[32]
Kieffer, J. C.
``Strong universal noiseless block coding of a weakly closed class of ergodic multiterminal sources.''
J. Combin. Inform. System Sci.
6 (1981), no. 4, 297--307.
[31]
Kieffer, J. C.; Rahe, M.
``Markov channels are asymptotically mean stationary.''
SIAM J. Math. Anal.
12 (1981), no. 3, 293--305.
[30]
Fontana, R. J.; Gray, R. M.; Kieffer, J. C.
``Asymptotically mean stationary channels.''
IEEE Trans. Inform. Theory
27 (1981), no. 3, 308--316.
[29]
Kieffer, J. C.
``Zero-error stationary coding over stationary channels.''
Z. Wahrsch. Verw. Gebiete
56 (1981), no. 1, 113--126.
[28]
Kieffer, J. C. ``On the minimum rate for strong universal block coding of a class of ergodic sources.''
IEEE Trans. Inform. Theory 26 (1980), no. 6, 693--702.
[27]
Kieffer, J. C. ``Extension of source coding theorems for block codes to sliding-block codes.''
IEEE Trans. Inform. Theory 26 (1980), no. 6, 679--692.
[26]
Kieffer, J. C.
``Perfect transmission over a discrete memoryless channel requires infinite expected coding time.''
J. Combin. Inform. System Sci. 5 (1980), no. 4, 317--322.
[25]
Kieffer, J. C.
``On the transmission of Bernoulli sources over stationary channels.''
Ann. Probab.
8 (1980), no. 5, 942--961.
[24]
Kieffer, J. C.
``Some universal noiseless multiterminal source coding theorems.''
Inform. and Control
46 (1980), no. 2, 93--107.
[23]
Gray, R. M.; Kieffer, J. C.; Linde, Y.
``Locally optimal block quantizer design.''
Inform. and Control
45 (1980), no. 2, 178--198.
[22]
Gray, R. M.; Kieffer, J. C.
``Asymptotically mean stationary measures.''
Ann. Probab.
8 (1980), no. 5, 962--973.
[21]
Gray, R. M.; Kieffer, J. C.
``Mutual information rate, distortion, and quantization in metric spaces.''
IEEE Trans. Inform. Theory
26 (1980), no. 4, 412--422.
[20]
Kieffer, J. C. ``On coding a stationary process to achieve a given marginal distribution.''
Ann. Probab.
8 (1980), no. 1, 131--141.
[19]
Kieffer, J. C.
``Estimation of a convex real parameter of an unknown information source.''
Ann. Probab.
7 (1979), no. 5, 882--886.
[18]
Kieffer, J. C.
``Variable-length source coding with a cost depending only on the code word length.''
Inform. and Control
41 (1979), no. 2, 136--146.
[17]
Kieffer, J. C.
``A unified approach to weak universal source coding.''
IEEE Trans. Inform. Theory
24 (1978), no. 6, 674--682.
[16]
Kieffer, J. C.
``Block coding for an ergodic source relative to a zero-one valued fidelity criterion.''
IEEE Trans. Inform. Theory
24 (1978), no. 4, 432--438.
[15]
Kieffer, J. C.
``A generalization of the Pursley-Davisson-Mackenthun universal variable-rate coding theorem.''
IEEE Trans. Information Theory
23 (1977), no. 6, 694--697.
[14]
Kieffer, J. C.
``On sliding block coding for transmission of a source over a stationary nonanticipatory channel.''
Information and Control
35 (1977), no. 1, 1--19.
[13]
Kieffer, J. C.
``On the minimum number of fixed length sequences with fixed total probability.''
Ann. Probability
4 (1976), no. 2, 335--337.
[12]
Kieffer, J. C.
``Correction to: A counterexample to Perez's generalization of the Shannon-McMillan theorem.''
Ann. Probability
4 (1976), no. 1, 153--154.
[11]
Kieffer, J. C.
``A ratio limit theorem for a strongly subadditive set function in a locally compact amenable group.''
Pacific J. Math.
61 (1975), no. 1, 183--190.
[10]
Kieffer, J. C.
``A generalized Shannon-McMillan theorem for the action of an amenable group on a probability space.''
Ann. Probability
3 (1975), no. 6, 1031--1037.
[9]
Kieffer, J. C.
``On the optimum average distortion attainable by fixed-rate coding of a nonergodic source.''
IEEE Trans. Information Theory
21 (1975), 190--193.
[8]
Kieffer, J. C.
``An entropy equidistribution property for a measurable partition under the action of an amenable group.''
Bull. Amer. Math. Soc.
81 (1975), 464--466.
[7]
Kieffer, J. C.
``A general formula for the capacity of stationary nonanticipatory channels.''
Information and Control
26 (1974), no. 4, 381--391.
[6]
Kieffer, J. C.
``On the approximation of stationary measures by periodic and ergodic measures.''
Ann. Probability
2 (1974), 530--534.
[5]
Kieffer, J. C.
``A lower bound on the probability of decoding error for the finite-state channel.''
IEEE Trans. Information Theory
20 (1974), 549--551.
[4]
Kieffer, J. C.
``A simple proof of the Moy-Perez generalization of the Shannon-McMillan theorem.''
Pacific J. Math.
51 (1974), 203--206.
[3]
Kieffer, J. C.
``A counterexample to Perez's generalization of the Shannon-McMillan theorem.''
Ann. Probability
1 (1973), 362--364.
[2]
Kieffer, J. C.
``A covering theorem.''
Amer. Math. Monthly
80 (1973), 410--411.
[1]
Kieffer, J. C.; Stein, F. M.
``Solution of an equation in a linear algebra by means of the minimal polynomial.''
Math. Mag.
42 (1969), 114--121.