| 137 | -- | 144 | Alberto Leon-Garcia, Lee D. Davisson, David L. Neuhoff. New results on coding of stationary nonergodic sources |
| 145 | -- | 155 | Dimitris Anastassiou, David J. Sakrison. New bounds to R(D) for additive sources and applications to image encoding |
| 155 | -- | 166 | Mario A. Blanco, Francis S. Hill Jr.. On time warping and the random delay channel |
| 166 | -- | 169 | Abbas A. El Gamal. The capacity of a class of broadcast channels |
| 170 | -- | 178 | Renato Dogliotti, Angelo Luvison, Giancarlo Pirani. Error probability in optical fiber transmission systems |
| 179 | -- | 192 | Jeffrey H. Shapiro, Horace P. Yuen, Jesus A. Machado-Mata. Optical communication with two-photon coherent states-Part II: Photoemissive detection and structured receiver performance |
| 193 | -- | 202 | Alain Crolotte, Judea Pearl. Bounds on memory versus error trade-offs in question-answering systems |
| 202 | -- | 207 | Luc Devroye, Terry J. Wagner. Distribution-free inequalities for the deleted and holdout error estimates |
| 208 | -- | 210 | Luc Devroye, Terry J. Wagner. Distribution-free performance bounds with the resubstitution error estimate (Corresp.) |
| 210 | -- | 213 | Jack Koplowitz. Finite memory hypothesis testing with dependent samples (Corresp.) |
| 213 | -- | 218 | Paul R. Prucnal, Malvin C. Teich. Single-Threshold Detection of a Random Signal in Noise with Multiple Independent Observations, Part 2: Continuous Case |
| 218 | -- | 219 | Roger J. Webster. Moments of the truncated noncentral chi-squared distribution (Corresp.) |
| 219 | -- | 221 | János Körner, Katalin Marton. How to encode the modulo-two sum of binary sources (Corresp.) |
| 221 | -- | 225 | Hatsukazu Tanaka, H. Matsuo, Seiko Kaneku. Efficient encoding of sources with memory (Corresp.) |
| 225 | -- | 228 | Huseyin Abut, N. Erodol. 1 (D) functions for speech probability models (Corresp.) |
| 228 | -- | 231 | R. Benzel. The capacity region of a class of discrete additive degraded interference channels (Corresp.) |
| 231 | -- | 232 | Willem H. Haemers. On Some Problems of Lovász Concerning the Shannon Capacity of a Graph |
| 232 | -- | 233 | Gilles Brassard. A note on the complexity of cryptography (Corresp.) |
| 233 | -- | 234 | Viiveke Fåk. Repeated use of codes which detect deception (Corresp.) |
| 234 | -- | 236 | E. Verriest, Martin E. Hellman. Convolutional encoding for Wyner's wiretap channel (Corresp.) |
| 237 | -- | 240 | Philippe Piret. Causal sliding block encoders with feedback (Corresp.) |
| 240 | -- | 243 | Gregory S. Lauer. Some optimal partial-unit-memory codes (Corresp.) |
| 243 | -- | 246 | D. V. Gupta, Jack K. Wolf. A shortened Viterbi decoding algorithm for terminated rate- 1/N convolutional codes with hard decisions (Corresp.) |
| 246 | -- | 250 | Kenneth K. Tzeng, C. Y. Yu. Characterization theorems for extending Goppa codes to cyclic codes (Corresp.) |
| 250 | -- | 254 | Chandra Satyanarayana. Lee metric codes over integer residue rings (Corresp.) |
| 257 | -- | 0 | Tamer Basar. Performance Bounds and Optimal Linear Coding for Multichannel Communication Systems (Ph.D. Thesis abstr.) |
| 257 | -- | 0 | Roger L. Peterson. Tree, Trellis, and Convolutional Coding for Multiple-Access Channels (Ph.D. Thesis abstr.) |
| 257 | -- | 0 | Shih-Chun Chang. Coding for a T-User Multiple-Access Channel (Ph.D. Thesis abstr.) |