John C. Kieffer
Orcid: 0000-0002-3108-2323Affiliations:
- University of Minnesota, USA
According to our database1,
John C. Kieffer
authored at least 72 papers
between 1974 and 2016.
Collaborative distances:
Collaborative distances:
Timeline
1975
1980
1985
1990
1995
2000
2005
2010
2015
0
1
2
3
4
5
6
7
1
1
2
1
1
2
1
4
1
1
3
1
1
2
2
2
2
1
1
1
2
4
3
5
1
2
2
1
2
1
1
2
2
1
1
1
2
2
1
1
1
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on ece.umn.edu
On csauthors.net:
Bibliography
2016
Proceedings of the IEEE International Symposium on Information Theory, 2016
2014
IEEE Trans. Inf. Theory, 2014
2013
Redundancy analysis in lossless compression of a binary tree via its minimal DAG representation.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013
2011
Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011
Proceedings of the First International Conference on Data Compression, 2011
2010
CoRR, 2010
Proceedings of the IEEE International Symposium on Information Theory, 2010
Proceedings of the IEEE International Symposium on Information Theory, 2010
2009
Proceedings of the IEEE International Symposium on Information Theory, 2009
2008
2007
IEEE Trans. Inf. Theory, 2007
Strongly consistent nonparametric forecasting and regression for stationary ergodic sequences.
CoRR, 2007
Proceedings of the IEEE International Symposium on Information Theory, 2007
2006
Performance Studies of a Coding Scheme for a Slepian-Wolf Source Network.
Proceedings of the 2006 International Conference on Communications in Computing, 2006
2005
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005
2004
IEEE Trans. Inf. Theory, 2004
IEEE Trans. Inf. Theory, 2004
IEEE Trans. Image Process., 2004
A new high rate code scheme with highly parallel and low complexity decoding algorithm.
IEEE Commun. Lett., 2004
Proceedings of the 2004 IEEE Information Theory Workshop, 2004
A Simple parallel dual code decoding algorithm for convolutional codes with high throughput and low latency.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004
2003
Embedded image transmission based on adaptive modulation and constrained retransmission over block fading channels.
Proceedings of the 2003 IEEE International Conference on Acoustics, 2003
2002
Commun. Inf. Syst., 2002
2001
Universal lossless data compression with side information by using a conditional MPM grammar transform.
IEEE Trans. Inf. Theory, 2001
2000
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform - Part one: Without context models.
IEEE Trans. Inf. Theory, 2000
IEEE Trans. Inf. Theory, 2000
IEEE Trans. Inf. Theory, 2000
Proceedings of the 2000 International Conference on Image Processing, 2000
1999
A Simple Technique for Bounding the Pointwise Redundancy of the 1978 Lempel-Ziv Algorithm.
Proceedings of the Data Compression Conference, 1999
1998
IEEE Trans. Inf. Theory, 1998
Proceedings of the 1998 IEEE International Conference on Image Processing, 1998
Proceedings of the Data Compression Conference, 1998
1997
On the redundancy of the fixed-database Lempel-Ziv algorithm for phi -mixing sources.
IEEE Trans. Inf. Theory, 1997
Proceedings of the Proceedings 1997 International Conference on Image Processing, 1997
1996
Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm.
IEEE Trans. Inf. Theory, 1996
Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity.
IEEE Trans. Inf. Theory, 1996
1993
IEEE Trans. Inf. Theory, 1993
Strongly consistent code-based identification and order estimation for constrained finite-state model classes.
IEEE Trans. Inf. Theory, 1993
1991
IEEE Trans. Inf. Theory, 1991
1990
Comparison of two optimum rates for noiseless encoding of a nonstationary information source.
IEEE Trans. Inf. Theory, 1990
IEEE Trans. Commun., 1990
1989
Finite-state adaptive block to variable-length noiseless coding of a nonstationary information source.
IEEE Trans. Inf. Theory, 1989
1988
IEEE Trans. Inf. Theory, 1988
1987
IEEE Trans. Inf. Theory, 1987
1983
IEEE Trans. Inf. Theory, 1983
Uniqueness of locally optimal quantizer for log-concave density and convex error weighting function.
IEEE Trans. Inf. Theory, 1983
1982
IEEE Trans. Inf. Theory, 1982
IEEE Trans. Inf. Theory, 1982
1981
IEEE Trans. Inf. Theory, 1981
1980
Inf. Control., August, 1980
IEEE Trans. Inf. Theory, 1980
IEEE Trans. Inf. Theory, 1980
IEEE Trans. Inf. Theory, 1980
1979
Inf. Control., May, 1979
1978
IEEE Trans. Inf. Theory, 1978
1977
On Sliding Block Coding for Transmission of a Source over a Stationary Nonanticipatory Channel
Inf. Control., September, 1977
A generalization of the Pursley-Davisson- Mackenthun universal variable-rate coding theorem.
IEEE Trans. Inf. Theory, 1977
1975
On the optimum average distortion attainable by fixed-rate coding of a nonergodic source.
IEEE Trans. Inf. Theory, 1975
1974
Inf. Control., December, 1974
A lower bound on the probability of decoding error for the finite-state channel (Corresp.).
IEEE Trans. Inf. Theory, 1974