S. Natarajan Large deviations, hypotheses testing, and source coding for finite Markov chains. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:360-365 [Journal]
Lev B. Levitin, Carlos R. P. Hartmann A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:378-384 [Journal]
Kristien de Bruyn Codes for the asymmetric broadcast channel, generated by permutations. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:419-0 [Journal]
Kristien de Bruyn An iterative code construction for the broadcast channel with degraded message sets. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:422-0 [Journal]
Philippe Piret Binary codes for compound channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:436-0 [Journal]
Y. C. Yao Estimation of noisy telegraph processes: Nonlinear filtering versus nonlinear smoothing. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:444-0 [Journal]