| 901 | -- | 909 | Benny Chor, Ronald L. Rivest. A knapsack-type public key cryptosystem based on arithmetic in finite fields |
| 910 | -- | 917 | Bruce E. Hajek, Galen H. Sasaki. Link scheduling in polynomial time |
| 918 | -- | 930 | Ramesh R. Rao, Anthony Ephremides. On the stability of interacting queues in a multiple-access system |
| 931 | -- | 942 | Lazaros F. Merakos, Chatschik Bisdikian. Delay analysis of the n -ary stack random-access algorithm |
| 943 | -- | 959 | Richard J. Barton, H. Vincent Poor. Signal detection in fractional Gaussian noise |
| 960 | -- | 972 | H. Vincent Poor. Fine quantization in signal detection and estimation |
| 973 | -- | 978 | Lee K. Jones. A stochastic multisample extension of Morris s robust detector in bounded amplitude noise |
| 979 | -- | 994 | Rodney M. Goodman, Padhraic Smyth. Decision tree design from a communication theory standpoint |
| 995 | -- | 1003 | Brian L. Hughes, Prakash Narayan. The capacity of a vector Gaussian arbitrarily varying channel |
| 1004 | -- | 1010 | Chein-I Chang, Lee D. Davisson. On calculating the capacity of an infinite-input finite (infinite)-output channel |
| 1011 | -- | 1020 | Marc Rouanne, Daniel J. Costello Jr.. A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes |
| 1021 | -- | 1032 | Paul K. M. Ho, Peter J. McLane. Spectrum, distance, and receiver complexity of encoded continuous phase modulation |
| 1033 | -- | 1040 | Yariv Ephraim, Hanoch Lev-Ari, Robert M. Gray. Asymptotic minimum discrimination information measure for asymptotically weakly stationary processes |
| 1041 | -- | 1048 | Ofer Zeitouni. On the filtering of noise-contaminated signals observed via hard limiters |
| 1049 | -- | 0 | Douglas J. Muder. Minimal trellises for block codes |
| 1053 | -- | 0 | Martin C. Rost, Khalid Sayood. The root lattices as low bit rate vector quantizers |
| 1058 | -- | 0 | V. Sidorenko, Rolf Johannesson, Kamil Sh. Zigangirov. On sequential decoding for the Gilbert channel |
| 1061 | -- | 0 | Mario Blaum, Patrick G. Farrell, Henk C. A. van Tilborg. Multiple burst-correcting array codes |
| 1066 | -- | 0 | C. Foias, Arthur E. Frazho, Peter J. Sherman. A geometric approach to the maximum likelihood spectral estimator for sinusoids in noise |
| 1070 | -- | 0 | Peter Elias. Zero error capacity under list decoding |
| 1074 | -- | 0 | David C. Larson, Jonathan J. Ashley, Thomas D. Howell. On the minimum length error event of minimum Euclidean weight |
| 1077 | -- | 0 | Jovan Dj. Golic, Miodrag V. Zivkovic. On the linear complexity of nonuniformly decimated PN-sequences |
| 1079 | -- | 0 | Kjell Jørgen Hole. New short constraint length rate (n-1)/n punctured convolutional codes for soft-decision Viterbi decoding |
| 1081 | -- | 0 | James A. Bucklew. A large deviation theory proof of the abstract alphabet source coding theorem |
| 1083 | -- | 0 | Fabrizio Pollara, Robert J. McEliece, Khaled A. S. Abdel-Ghaffar. Finite-state codes |
| 1089 | -- | 0 | Jehoshua Bruck, Joseph W. Goodman. A generalized convergence theorem for neural networks |
| 1092 | -- | 0 | Ahmed H. Tewfik, Bernard C. Levy, Alan S. Willsky. Sampling theorems for two-dimensional isotropic random fields |
| 1097 | -- | 0 | Andrew R. Barron, Thomas M. Cover. A bound on the financial value of information |
| 1100 | -- | 0 | Peter Vanroose. Code construction for the noiseless binary switching multiple-access channel |
| 1106 | -- | 0 | Zhen Zhang. Partial converse for a relay channel |
| 1110 | -- | 0 | Hanan Rosenthal, Jacob Binia. On the epsilon entropy of mixed random variables |
| 1121 | -- | 0 | Toby Berger. Preface to special issue on coding techniques and coding theory |
| 1122 | -- | 0 | Daniel J. Costello Jr.. Introduction to special section on coding techniques |
| 1123 | -- | 1151 | G. David Forney Jr.. Coset codes-I: Introduction and geometrical classification |
| 1188 | -- | 1202 | Jean-Pierre Adoul, Michel Barth. Nearest neighbor algorithm for spherical codes from the Leech lattice |
| 1203 | -- | 1216 | Nambirajan Seshadri, John B. Anderson. Asymptotic error performance of modulation codes in the presence of severe intersymbol interference |
| 1217 | -- | 1225 | Jørn Justesen, Christian Thommesen, Victor V. Zyablov. Concatenated codes with convolutional inner codes |
| 1226 | -- | 1241 | George H. Freeman, Ian F. Blake, Jon W. Mark. Trellis source code design as an optimization problem |
| 1242 | -- | 1249 | Anselm Blumer, Robert J. McEliece. The Rényi redundancy of generalized Huffman codes |
| 1250 | -- | 1258 | John C. Kieffer, Teresa M. Jahns, Viktor A. Obuljen. New results on optimal entropy-constrained quantization |
| 1259 | -- | 0 | Federico Kuhlmann, James A. Bucklew. Piecewise uniform vector quantizers |
| 1263 | -- | 0 | Göran Lindell, Carl-Erik W. Sundberg. An upper bound on the bit error probability of combined convolutional coding and continuous phase modulation |
| 1269 | -- | 0 | Daniel Zwillinger. Differential PPM has a higher throughput than PPM for the band-limited and average-power-limited optical channel (corresp.) |
| 1274 | -- | 0 | Jacobus H. van Lint. Introduction to special section on coding theory |
| 1276 | -- | 1280 | A. Robert Calderbank, Neil J. A. Sloane. Inequalities for covering codes |
| 1281 | -- | 1285 | János Pach, Joel Spencer. Explicit codes with low covering radius |
| 1286 | -- | 1307 | Jean-Paul Boly, Wil J. van Gils. Codes for combined symbol and digit error control |
| 1308 | -- | 1316 | Tuvi Etzion. Constructions for perfect maps and pseudorandom arrays |
| 1317 | -- | 1320 | Heinz Georg Quebbemann. Cyclotomic Goppa codes |
| 1321 | -- | 1331 | Jacobus H. Weber, Cornelis de Vroedt, Dick E. Boekee. Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6 |
| 1332 | -- | 1340 | Patrick Stevens. Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities |
| 1341 | -- | 0 | Michael Wirtz. On the parameters of Goppa codes |
| 1343 | -- | 0 | Iiro S. Honkala, Heikki O. Hämäläinen. A new construction for covering codes |
| 1344 | -- | 0 | Juriaan Simonis. The minimal covering radius t[15, 6] of a six-dimensional binary linear code of length 15 is equal to 4 |
| 1345 | -- | 0 | Henning Stichtenoth. A note on Hermitian codes over GF(q:::2:::) |
| 1348 | -- | 0 | J. C. C. M. Remijn, H. J. Tiersma. A duality theorem for the weight distribution of some cyclic codes |
| 1351 | -- | 0 | Akira Shiozaki. Decoding of redundant residue polynomial codes using Euclid s algorithm |
| 1354 | -- | 0 | Jeffrey S. Leon. A probabilistic algorithm for computing minimum weights of large error-correcting codes |