John C. Kieffer

Orcid: 0000-0002-3108-2323

Affiliations:
  • University of Minnesota, USA


According to our database1, John C. Kieffer authored at least 72 papers between 1974 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
Information Sources on a Bratteli diagram.
CoRR, 2016

A survey of Bratteli information source theory.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2014
A Universal Grammar-Based Code for Lossless Compression of Binary Trees.
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
Universal Lossless Data Compression Via Binary Decision Diagrams
CoRR, 2011

A Catalog of Self-Affine Hierarchical Entropy Functions.
Algorithms, 2011

Advances in Optimal Structured Source Code Design.
Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

Hierarchical Type Classes and Their Entropy Functions.
Proceedings of the First International Conference on Data Compression, 2011

2010
Exact Hamming Distortion Analysis of Viterbi Encoded Trellis Coded Quantizers
CoRR, 2010

Fractal compression rate curves in lossless compression of balanced trees.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Local coordinates of a trellis source code.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Structural complexity of random binary trees.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Optimality of Bus-Invert Coding.
IEEE Trans. Circuits Syst. II Express Briefs, 2008

2007
epsilon-Capacity of Binary Symmetric Averaged Channels.
IEEE Trans. Inf. Theory, 2007

Strongly consistent nonparametric forecasting and regression for stationary ergodic sequences.
CoRR, 2007

Fast Generation of Tunstall Codes.
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
Exact BER computation for cross QAM constellations.
IEEE Trans. Wirel. Commun., 2005

On the pointwise redundancy of the LZ78 algorithm.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Perturbations in optimal trellis source code design.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Grammar-based lossless universal refinement source coding.
IEEE Trans. Inf. Theory, 2004

Problems on Sequences: Information Theory and Computer Science Interface.
IEEE Trans. Inf. Theory, 2004

Embedded image compression based on wavelet pixel classification and sorting.
IEEE Trans. Image Process., 2004

A new high rate code scheme with highly parallel and low complexity decoding algorithm.
IEEE Commun. Lett., 2004

Grammar-based coding: new perspectives.
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
Structured grammar-based codes for universal lossless data compression.
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

Universal lossless compression via multilevel pattern matching.
IEEE Trans. Inf. Theory, 2000

Grammar-based codes: A new class of universal lossless source codes.
IEEE Trans. Inf. Theory, 2000

Resolution Scalable Lossless Progressive Image Coding via Conditional Quadrisection.
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
On the Performance of Data Compression Algorithms Based Upon String Matching.
IEEE Trans. Inf. Theory, 1998

Progressive Lossless Image Coding via Self-Referential Partitions.
Proceedings of the 1998 IEEE International Conference on Image Processing, 1998

Complexity of Preprocessor in MPM Data Compression System.
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

Progressive Transmission in Trellis Coded Quanitization-Based Image Coders.
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
A survey of the theory of source coding with a fidelity criterion.
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
Sample converses in source coding theory.
IEEE Trans. Inf. Theory, 1991

Strong converses in source coding relative to a fidelity criterion.
IEEE Trans. Inf. Theory, 1991

1990
Comparison of two optimum rates for noiseless encoding of a nonstationary information source.
IEEE Trans. Inf. Theory, 1990

Analysis of DC input response for a class of one-bit feedback encoders.
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
New results on optimal entropy-constrained quantization.
IEEE Trans. Inf. Theory, 1988

1987
Fixed-rate encoding of nonstationary information sources.
IEEE Trans. Inf. Theory, 1987

1983
On a type of stochastic stability for a class of encoding schemes.
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
Stochastic stability for feedback quantization schemes.
IEEE Trans. Inf. Theory, 1982

Exponential rate of convergence for Lloyd's method I.
IEEE Trans. Inf. Theory, 1982

Characterizations of d -total boundedness for classes of B sources.
IEEE Trans. Inf. Theory, 1982

Sliding-block coding for weakly continuous channels.
IEEE Trans. Inf. Theory, 1982

1981
Block coding for weakly continuous channels.
IEEE Trans. Inf. Theory, 1981

A method for proving multiterminal source coding theorems.
IEEE Trans. Inf. Theory, 1981

Asymptotically mean stationary channels.
IEEE Trans. Inf. Theory, 1981

1980
Some Universal Noiseless Multiterminal Source Coding Theorems
Inf. Control., August, 1980

Locally Optimal Block Quantizer Design
Inf. Control., May, 1980

On the minimum rate for strong universal block coding of a class of ergodic sources.
IEEE Trans. Inf. Theory, 1980

Extension of source coding theorems for block codes to sliding-block codes.
IEEE Trans. Inf. Theory, 1980

Mutual information rate, distortion, and quantization in metric spaces.
IEEE Trans. Inf. Theory, 1980

1979
Variable-Length Source Coding with a Cost Depending Only on the Code Word Length
Inf. Control., May, 1979

1978
A unified approach to weak universal source coding.
IEEE Trans. Inf. Theory, 1978

Block coding for an ergodic source relative to a zero-one valued fidelity criterion.
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
A General Formula for the Capacity of Stationary Nonanticipatory Channels
Inf. Control., December, 1974

A lower bound on the probability of decoding error for the finite-state channel (Corresp.).
IEEE Trans. Inf. Theory, 1974


  Loading...