default search action
John C. Kieffer
Person information
- affiliation: University of Minnesota, USA
Other persons with a similar name
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [c20]John C. Kieffer:
A survey of Bratteli information source theory. ISIT 2016: 16-20 - [i5]John C. Kieffer:
Information Sources on a Bratteli diagram. CoRR abs/1605.01120 (2016) - 2014
- [j49]Jie Zhang, En-Hui Yang, John C. Kieffer:
A Universal Grammar-Based Code for Lossless Compression of Binary Trees. IEEE Trans. Inf. Theory 60(3): 1373-1386 (2014) - 2013
- [c19]Jie Zhang, En-Hui Yang, John C. Kieffer:
Redundancy analysis in lossless compression of a binary tree via its minimal DAG representation. ISIT 2013: 1914-1918 - [i4]Jie Zhang, En-Hui Yang, John C. Kieffer:
A Universal Grammar-Based Code For Lossless Compression of Binary Trees. CoRR abs/1304.7392 (2013) - 2011
- [j48]John C. Kieffer:
A Catalog of Self-Affine Hierarchical Entropy Functions. Algorithms 4(4): 307-333 (2011) - [c18]John C. Kieffer:
Hierarchical Type Classes and Their Entropy Functions. CCP 2011: 246-254 - [c17]John C. Kieffer, John Marcos:
Advances in Optimal Structured Source Code Design. DCC 2011: 13-22 - [i3]John C. Kieffer, Philippe Flajolet, En-Hui Yang:
Universal Lossless Data Compression Via Binary Decision Diagrams. CoRR abs/1111.1432 (2011) - 2010
- [c16]Sang-youn Oh, John C. Kieffer:
Fractal compression rate curves in lossless compression of balanced trees. ISIT 2010: 106-110 - [c15]John C. Kieffer, John Marcos:
Local coordinates of a trellis source code. ISIT 2010: 111-115 - [i2]John C. Kieffer, Yu Liao:
Exact Hamming Distortion Analysis of Viterbi Encoded Trellis Coded Quantizers. CoRR abs/1010.1286 (2010)
2000 – 2009
- 2009
- [c14]John C. Kieffer, En-Hui Yang, Wojciech Szpankowski:
Structural complexity of random binary trees. ISIT 2009: 635-639 - 2008
- [j47]Fakhrul Zaman Rokhani, Wen-Chih Kan, John C. Kieffer, Gerald E. Sobelman:
Optimality of Bus-Invert Coding. IEEE Trans. Circuits Syst. II Express Briefs 55-II(11): 1134-1138 (2008) - 2007
- [j46]John C. Kieffer:
epsilon-Capacity of Binary Symmetric Averaged Channels. IEEE Trans. Inf. Theory 53(1): 288-303 (2007) - [c13]John C. Kieffer:
Fast Generation of Tunstall Codes. ISIT 2007: 76-80 - [i1]Sidney Yakowitz, László Györfi, John C. Kieffer, Gusztáv Morvai:
Strongly consistent nonparametric forecasting and regression for stationary ergodic sequences. CoRR abs/0712.2592 (2007) - 2006
- [c12]Azizuddin Abdul Aziz, John C. Kieffer:
Performance Studies of a Coding Scheme for a Slepian-Wolf Source Network. Communications in Computing 2006: 14-20 - 2005
- [j45]Pavan K. Vitthaladevuni, Mohamed-Slim Alouini, John C. Kieffer:
Exact BER computation for cross QAM constellations. IEEE Trans. Wirel. Commun. 4(6): 3039-3050 (2005) - [c11]En-Hui Yang, Lihua Song, Gil I. Shamir, John C. Kieffer:
On the pointwise redundancy of the LZ78 algorithm. ISIT 2005: 495-499 - [c10]John C. Kieffer:
Perturbations in optimal trellis source code design. ISIT 2005: 1927-1931 - 2004
- [j44]Yu Liao, John C. Kieffer:
A new high rate code scheme with highly parallel and low complexity decoding algorithm. IEEE Commun. Lett. 8(6): 386-387 (2004) - [j43]Kewu Peng, John C. Kieffer:
Embedded image compression based on wavelet pixel classification and sorting. IEEE Trans. Image Process. 13(8): 1011-1017 (2004) - [j42]John C. Kieffer, Wojciech Szpankowski, En-Hui Yang:
Problems on Sequences: Information Theory and Computer Science Interface. IEEE Trans. Inf. Theory 50(7): 1385-1392 (2004) - [j41]John C. Kieffer, En-Hui Yang:
Grammar-based lossless universal refinement source coding. IEEE Trans. Inf. Theory 50(7): 1415-1424 (2004) - [c9]Yu Liao, John C. Kieffer:
A Simple parallel dual code decoding algorithm for convolutional codes with high throughput and low latency. ISIT 2004: 491 - [c8]En-Hui Yang, Da-ke He, John C. Kieffer:
Grammar-based coding: new perspectives. ITW 2004: 105-110 - 2003
- [c7]Kewu Peng, John C. Kieffer, Qingwen Liu, Shengli Zhou:
Embedded image transmission based on adaptive modulation and constrained retransmission over block fading channels. ICASSP (5) 2003: 696-699 - 2002
- [j40]John C. Kieffer, En-Hui Yang:
Structured grammar-based codes for universal lossless data compression. Commun. Inf. Syst. 2(1): 29-52 (2002) - [c6]Kewu Peng, John C. Kieffer:
Embedded image compression based on wavelet pixel classification and sorting. ICASSP 2002: 3253-3256 - 2001
- [j39]En-Hui Yang, Alexei Kaltchenko, John C. Kieffer:
Universal lossless data compression with side information by using a conditional MPM grammar transform. IEEE Trans. Inf. Theory 47(6): 2130-2150 (2001) - 2000
- [j38]John C. Kieffer, En-Hui Yang:
Grammar-based codes: A new class of universal lossless source codes. IEEE Trans. Inf. Theory 46(3): 737-754 (2000) - [j37]En-Hui Yang, John C. Kieffer:
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform - Part one: Without context models. IEEE Trans. Inf. Theory 46(3): 755-777 (2000) - [j36]John C. Kieffer, En-Hui Yang, Gregory J. Nelson, Pamela C. Cosman:
Universal lossless compression via multilevel pattern matching. IEEE Trans. Inf. Theory 46(4): 1227-1245 (2000) - [c5]Ross Stites, John C. Kieffer:
Resolution Scalable Lossless Progressive Image Coding via Conditional Quadrisection. ICIP 2000: 976-979
1990 – 1999
- 1999
- [c4]John C. Kieffer, En-Hui Yang:
A Simple Technique for Bounding the Pointwise Redundancy of the 1978 Lempel-Ziv Algorithm. Data Compression Conference 1999: 434-442 - 1998
- [j35]En-Hui Yang, John C. Kieffer:
On the Performance of Data Compression Algorithms Based Upon String Matching. IEEE Trans. Inf. Theory 44(1): 47-65 (1998) - [c3]John C. Kieffer, En-Hui Yang, Trevor Park, Sidney Yakowitz:
Complexity of Preprocessor in MPM Data Compression System. Data Compression Conference 1998: 554 - [c2]John C. Kieffer, T. H. Park, Y. Xu, Sidney Yakowitz:
Progressive Lossless Image Coding via Self-Referential Partitions. ICIP (1) 1998: 498-502 - 1997
- [j34]En-Hui Yang, John C. Kieffer:
On the redundancy of the fixed-database Lempel-Ziv algorithm for phi -mixing sources. IEEE Trans. Inf. Theory 43(4): 1101-1111 (1997) - [c1]Philip J. Sementilli, Ali Bilgin, Fang Sheng, Michael W. Marcellin, John C. Kieffer:
Progressive Transmission in Trellis Coded Quanitization-Based Image Coders. ICIP (1) 1997: 588-591 - 1996
- [j33]John C. Kieffer, En-Hui Yang:
Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity. IEEE Trans. Inf. Theory 42(1): 29-39 (1996) - [j32]En-Hui Yang, John C. Kieffer:
Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm. IEEE Trans. Inf. Theory 42(1): 239-245 (1996) - 1993
- [j31]John C. Kieffer:
Strongly consistent code-based identification and order estimation for constrained finite-state model classes. IEEE Trans. Inf. Theory 39(3): 893-902 (1993) - [j30]John C. Kieffer:
A survey of the theory of source coding with a fidelity criterion. IEEE Trans. Inf. Theory 39(5): 1473-1490 (1993) - 1991
- [j29]John C. Kieffer:
Strong converses in source coding relative to a fidelity criterion. IEEE Trans. Inf. Theory 37(2): 257-262 (1991) - [j28]John C. Kieffer:
Sample converses in source coding theory. IEEE Trans. Inf. Theory 37(2): 263-268 (1991) - 1990
- [j27]John C. Kieffer:
Analysis of DC input response for a class of one-bit feedback encoders. IEEE Trans. Commun. 38(3): 337-340 (1990) - [j26]John C. Kieffer:
Comparison of two optimum rates for noiseless encoding of a nonstationary information source. IEEE Trans. Inf. Theory 36(2): 256-261 (1990)
1980 – 1989
- 1989
- [j25]John C. Kieffer:
Finite-state adaptive block to variable-length noiseless coding of a nonstationary information source. IEEE Trans. Inf. Theory 35(6): 1259-1263 (1989) - 1988
- [j24]John C. Kieffer, Teresa M. Jahns, Viktor A. Obuljen:
New results on optimal entropy-constrained quantization. IEEE Trans. Inf. Theory 34(5): 1250-1258 (1988) - 1987
- [j23]John C. Kieffer:
Fixed-rate encoding of nonstationary information sources. IEEE Trans. Inf. Theory 33(5): 651-655 (1987) - 1983
- [j22]John C. Kieffer:
Uniqueness of locally optimal quantizer for log-concave density and convex error weighting function. IEEE Trans. Inf. Theory 29(1): 42-46 (1983) - [j21]John C. Kieffer, James George Dunham:
On a type of stochastic stability for a class of encoding schemes. IEEE Trans. Inf. Theory 29(6): 793-797 (1983) - 1982
- [j20]John C. Kieffer:
Sliding-block coding for weakly continuous channels. IEEE Trans. Inf. Theory 28(1): 2-10 (1982) - [j19]John C. Kieffer:
Characterizations of d -total boundedness for classes of B sources. IEEE Trans. Inf. Theory 28(1): 26-35 (1982) - [j18]John C. Kieffer:
Exponential rate of convergence for Lloyd's method I. IEEE Trans. Inf. Theory 28(2): 205-210 (1982) - [j17]John C. Kieffer:
Stochastic stability for feedback quantization schemes. IEEE Trans. Inf. Theory 28(2): 248-254 (1982) - 1981
- [j16]Robert J. Fontana, Robert M. Gray, John C. Kieffer:
Asymptotically mean stationary channels. IEEE Trans. Inf. Theory 27(3): 308-316 (1981) - [j15]John C. Kieffer:
A method for proving multiterminal source coding theorems. IEEE Trans. Inf. Theory 27(5): 565-569 (1981) - [j14]John C. Kieffer:
Block coding for weakly continuous channels. IEEE Trans. Inf. Theory 27(6): 721-727 (1981) - 1980
- [j13]Robert M. Gray, John C. Kieffer, Yoseph Linde:
Locally Optimal Block Quantizer Design. Inf. Control. 45(2): 178-198 (1980) - [j12]John C. Kieffer:
Some Universal Noiseless Multiterminal Source Coding Theorems. Inf. Control. 46(2): 93-107 (1980) - [j11]Robert M. Gray, John C. Kieffer:
Mutual information rate, distortion, and quantization in metric spaces. IEEE Trans. Inf. Theory 26(4): 412-422 (1980) - [j10]John C. Kieffer:
Extension of source coding theorems for block codes to sliding-block codes. IEEE Trans. Inf. Theory 26(6): 679-692 (1980) - [j9]John C. Kieffer:
On the minimum rate for strong universal block coding of a class of ergodic sources. IEEE Trans. Inf. Theory 26(6): 693-702 (1980)
1970 – 1979
- 1979
- [j8]John C. Kieffer:
Variable-Length Source Coding with a Cost Depending Only on the Code Word Length. Inf. Control. 41(2): 136-146 (1979) - 1978
- [j7]John C. Kieffer:
Block coding for an ergodic source relative to a zero-one valued fidelity criterion. IEEE Trans. Inf. Theory 24(4): 432-438 (1978) - [j6]John C. Kieffer:
A unified approach to weak universal source coding. IEEE Trans. Inf. Theory 24(6): 674-682 (1978) - 1977
- [j5]John C. Kieffer:
On Sliding Block Coding for Transmission of a Source over a Stationary Nonanticipatory Channel. Inf. Control. 35(1): 1-19 (1977) - [j4]John C. Kieffer:
A generalization of the Pursley-Davisson- Mackenthun universal variable-rate coding theorem. IEEE Trans. Inf. Theory 23(6): 694-697 (1977) - 1975
- [j3]John C. Kieffer:
On the optimum average distortion attainable by fixed-rate coding of a nonergodic source. IEEE Trans. Inf. Theory 21(2): 190-193 (1975) - 1974
- [j2]John C. Kieffer:
A General Formula for the Capacity of Stationary Nonanticipatory Channels. Inf. Control. 26(4): 381-391 (1974) - [j1]John C. Kieffer:
A lower bound on the probability of decoding error for the finite-state channel (Corresp.). IEEE Trans. Inf. Theory 20(4): 549-551 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint