John C. Kieffer, En-Hui Yang A Simple Technique for Bounding the Pointwise Redundancy of the 1978 Lempel-Ziv Algorithm. [Citation Graph (0, 0)][DBLP] Data Compression Conference, 1999, pp:434-442 [Conf]
John C. Kieffer A General Formula for the Capacity of Stationary Nonanticipatory Channels [Citation Graph (0, 0)][DBLP] Information and Control, 1974, v:26, n:4, pp:381-391 [Journal]
John C. Kieffer On Sliding Block Coding for Transmission of a Source over a Stationary Nonanticipatory Channel [Citation Graph (0, 0)][DBLP] Information and Control, 1977, v:35, n:1, pp:1-19 [Journal]
John C. Kieffer Variable-Length Source Coding with a Cost Depending Only on the Code Word Length [Citation Graph (0, 0)][DBLP] Information and Control, 1979, v:41, n:2, pp:136-146 [Journal]
John C. Kieffer Some Universal Noiseless Multiterminal Source Coding Theorems [Citation Graph (0, 0)][DBLP] Information and Control, 1980, v:46, n:2, pp:93-107 [Journal]
Kewu Peng, John C. Kieffer Embedded image compression based on wavelet pixel classification and sorting. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Image Processing, 2004, v:13, n:8, pp:1011-1017 [Journal]
John C. Kieffer A method for proving multiterminal source coding theorems. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1981, v:27, n:5, pp:565-569 [Journal]
John C. Kieffer Block coding for weakly continuous channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1981, v:27, n:6, pp:721-727 [Journal]
John C. Kieffer Sliding-block coding for weakly continuous channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1982, v:28, n:1, pp:2-10 [Journal]
John C. Kieffer Characterizations of d -total boundedness for classes of B sources. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1982, v:28, n:1, pp:26-35 [Journal]
John C. Kieffer Exponential rate of convergence for Lloyd's method I. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1982, v:28, n:2, pp:205-210 [Journal]
John C. Kieffer Stochastic stability for feedback quantization schemes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1982, v:28, n:2, pp:248-254 [Journal]
John C. Kieffer Uniqueness of locally optimal quantizer for log-concave density and convex error weighting function. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:1, pp:42-46 [Journal]
John C. Kieffer Fixed-rate encoding of nonstationary information sources. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:5, pp:651-655 [Journal]
John C. Kieffer Finite-state adaptive block to variable-length noiseless coding of a nonstationary information source. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:6, pp:1259-1263 [Journal]
John C. Kieffer Comparison of two optimum rates for noiseless encoding of a nonstationary information source. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:2, pp:256-261 [Journal]
John C. Kieffer Strong converses in source coding relative to a fidelity criterion. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:257-262 [Journal]
John C. Kieffer Sample converses in source coding theory. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:263-268 [Journal]
John C. Kieffer Strongly consistent code-based identification and order estimation for constrained finite-state model classes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:3, pp:893-902 [Journal]
John C. Kieffer A survey of the theory of source coding with a fidelity criterion. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:5, pp:1473-1490 [Journal]
John C. Kieffer, En-Hui Yang Grammar-based codes: A new class of universal lossless source codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:737-754 [Journal]
John C. Kieffer, En-Hui Yang Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:29-39 [Journal]
En-Hui Yang, John C. Kieffer Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform - Part one: Without context models. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:755-777 [Journal]
En-Hui Yang, John C. Kieffer Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:239-245 [Journal]
En-Hui Yang, John C. Kieffer On the redundancy of the fixed-database Lempel-Ziv algorithm for phi -mixing sources. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:4, pp:1101-1111 [Journal]
En-Hui Yang, John C. Kieffer On the Performance of Data Compression Algorithms Based Upon String Matching. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:47-65 [Journal]
John C. Kieffer epsilon-Capacity of Binary Symmetric Averaged Channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2007, v:53, n:1, pp:288-303 [Journal]
Search in 0.025secs, Finished in 0.028secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP