The SCEAS System
| |||||||

## Search the dblp DataBase
Paul C. Shields:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Robert M. Gray, Paul C. Shields
**The Maximum Mutual Information between Two Random Processes**[Citation Graph (0, 0)][DBLP] Information and Control, 1977, v:33, n:4, pp:273-280 [Journal] - David L. Neuhoff, Paul C. Shields
**Channel Distances and Representation**[Citation Graph (0, 0)][DBLP] Information and Control, 1982, v:55, n:1-3, pp:238-264 [Journal] - Jerome A. Feldman, Paul C. Shields
**Total Complexity and the Inference of Best Programs.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1977, v:10, n:, pp:181-191 [Journal] - Paul C. Shields
**Cutting and Independent Stacking of Intervals.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1973, v:7, n:1, pp:1-4 [Journal] - Imre Csiszár, Paul C. Shields
**Redundancy rates for renewal and other processes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2065-2072 [Journal] - David L. Neuhoff, Paul C. Shields
**Indecomposable finite state channels and primative approximation.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1982, v:28, n:1, pp:11-18 [Journal] - David L. Neuhoff, Paul C. Shields
**Simplistic Universal Coding. .**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:2, pp:778-781 [Journal] - Paul C. Shields
**The ergodic and entropy theorems revisited.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1987, v:33, n:2, pp:263-266 [Journal] - Paul C. Shields
**Cutting and stacking: A method for constructing stationary processes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1605-1617 [Journal] - Paul C. Shields
**The entropy theorem via coding bounds.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1645-0 [Journal] - Paul C. Shields
**Universal redundancy rates do not exist.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:520-524 [Journal] - Paul C. Shields
**The Interactions Between Ergodic Theory and Information Theory.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:6, pp:2079-2093 [Journal] - Paul C. Shields
**Performance of LZ Algorithms on Individual Sequences.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:4, pp:1283-1288 [Journal] - Paul C. Shields, Benjamin Weiss
**Universal redundancy rates for the class of B-processes do not exist.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1995, v:41, n:2, pp:508-512 [Journal]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |