| |
| 2004 | ||
|---|---|---|
| 15 | EE | Imre Csiszár, Paul C. Shields: Information Theory and Statistics: A Tutorial. Foundations and Trends in Communications and Information Theory 1(4): (2004) |
| 1999 | ||
| 14 | Paul C. Shields: Performance of LZ Algorithms on Individual Sequences. IEEE Transactions on Information Theory 45(4): 1283-1288 (1999) | |
| 1998 | ||
| 13 | David L. Neuhoff, Paul C. Shields: Simplistic Universal Coding. . IEEE Transactions on Information Theory 44(2): 778-781 (1998) | |
| 12 | Paul C. Shields: The Interactions Between Ergodic Theory and Information Theory. IEEE Transactions on Information Theory 44(6): 2079-2093 (1998) | |
| 1996 | ||
| 11 | Imre Csiszár, Paul C. Shields: Redundancy rates for renewal and other processes. IEEE Transactions on Information Theory 42(6): 2065-2072 (1996) | |
| 1995 | ||
| 10 | Paul C. Shields, Benjamin Weiss: Universal redundancy rates for the class of B-processes do not exist. IEEE Transactions on Information Theory 41(2): 508-512 (1995) | |
| 1993 | ||
| 9 | Paul C. Shields: Universal redundancy rates do not exist. IEEE Transactions on Information Theory 39(2): 520-524 (1993) | |
| 1991 | ||
| 8 | Paul C. Shields: Cutting and stacking: A method for constructing stationary processes. IEEE Transactions on Information Theory 37(6): 1605-1617 (1991) | |
| 7 | Paul C. Shields: The entropy theorem via coding bounds. IEEE Transactions on Information Theory 37(6): 1645- (1991) | |
| 1987 | ||
| 6 | Paul C. Shields: The ergodic and entropy theorems revisited. IEEE Transactions on Information Theory 33(2): 263-266 (1987) | |
| 1982 | ||
| 5 | David L. Neuhoff, Paul C. Shields: Indecomposable finite state channels and primative approximation. IEEE Transactions on Information Theory 28(1): 11-18 (1982) | |
| 4 | David L. Neuhoff, Paul C. Shields: Channel Distances and Representation Information and Control 55(1-3): 238-264 (1982) | |
| 1977 | ||
| 3 | Robert M. Gray, Paul C. Shields: The Maximum Mutual Information between Two Random Processes Information and Control 33(4): 273-280 (1977) | |
| 2 | Jerome A. Feldman, Paul C. Shields: Total Complexity and the Inference of Best Programs. Mathematical Systems Theory 10: 181-191 (1977) | |
| 1973 | ||
| 1 | Paul C. Shields: Cutting and Independent Stacking of Intervals. Mathematical Systems Theory 7(1): 1-4 (1973) | |
| 1 | Imre Csiszár | [11] [15] |
| 2 | Jerome A. Feldman | [2] |
| 3 | Robert M. Gray | [3] |
| 4 | David L. Neuhoff | [4] [5] [13] |
| 5 | Benjamin Weiss | [10] |