Takeshi Hashimoto Source coding for average rate and average distortion: New variable-length coding theorems. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:785-792 [Journal]
Jean C. Walrand A probabilistic look at networks of quasi-reversible queues. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:825-830 [Journal]
Chris Heegard Partitioned linear block codes for computer memory with 'stuck-at' defects. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:831-842 [Journal]
Richard A. Games A generalized recursive construction for de Bruijn sequences. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:843-849 [Journal]
Christian Thommesen The existence of binary linear concatenated codes with Reed - Solomon outer codes which asymptotically meet the Gilbert- Varshamov bound. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:850-853 [Journal]
Wil J. van Gils Two topics on linear unequal error protection codes: Bounds on their length and cyclic code classes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:866-876 [Journal]
J. Silverman, V. E. Vickers, J. L. Sampson Statistical estimates of the n-bit Gray codes by restricted random generation of permutations of 1 to 2n. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:894-901 [Journal]
Kiran M. Rege Min-max linear estimation of band-limited sequences from noisy observations - A deterministic approach. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:902-909 [Journal]
Aurel A. Lazar The throughput time delay function of an M/M/1 queue. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:914-0 [Journal]
Hirosuke Yamamoto A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:918-0 [Journal]
Abbas A. El Gamal A simple proof of the Ahlswede - Csiszár one-bit theorem. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:931-0 [Journal]
Michele Elia Some results on the existence of binary linear codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:933-0 [Journal]
James A. Wiseman New binary codes constructed by an old technique. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:936-0 [Journal]
V. Z. Marmarelis Practical estimation of correlation functions of nonstationary Gaussian processes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:937-0 [Journal]
Rodney W. Johnson, John E. Shore Comments on and correction to 'Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy' (Jan 80 26-37). [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:942-0 [Journal]