| 453 | -- | 465 | Roger S. Cheng, Sergio Verdú. Capacity of root-mean-square bandlimited Gaussian multiuser channels |
| 466 | -- | 474 | Raymond W. Yeung. A new outlook of Shannon s information measures |
| 475 | -- | 481 | Douglas J. Warren, John B. Thomas. Asymptotically robust detection and estimation for very heavy-tailed noise |
| 482 | -- | 489 | G. R. Dattatreya, Laveen N. Kanal. Asymptotically efficient estimation of prior probabilities in multiclass finite mixtures |
| 490 | -- | 499 | Adam Krzyzak. On exponential bounds on the Bayes risk of the kernel classification rule |
| 500 | -- | 513 | Wu Chou, Robert M. Gray. Dithering and its effects on sigma-delta and multistage sigma-delta modulation |
| 514 | -- | 527 | John S. Sadowsky, Randall K. Bahr. Direct-sequence spread-spectrum multiple-access communications with random signature sequences: A large deviations analysis |
| 528 | -- | 534 | Yoram Baram. On the capacity of ternary Hebbian networks |
| 535 | -- | 540 | Venkat Anantharam. The stability region of the finite-user slotted ALOHA protocol |
| 541 | -- | 551 | José L. Marroquín, Arturo Ramírez. Stochastic cellular automata with Gibbsian invariant measures |
| 552 | -- | 555 | T. Aaron Gulliver, Vijay K. Bhargava. Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes |
| 556 | -- | 563 | Neri Merhav. Universal coding with minimum probability of codeword length overflow |
| 564 | -- | 572 | Raymond W. Yeung. Alphabetic codes revisited |
| 573 | -- | 582 | Zhen Zhang. Linear inequalities for covering codes: Part I: Pair covering inequalities |
| 583 | -- | 602 | Ruud Pellikaan, Ba-Zhong Shen, Gerhard J. M. van Wee. Which linear codes are algebraic-geometric? |
| 603 | -- | 616 | P. Vijay Kumar, Oscar Moreno. Prime-phase sequences with periodic correlation properties better than binary sequences |
| 617 | -- | 626 | Jørn M. Jensen, Helge Elbrønd Jensen, Tom Høholdt. The merit factor of binary sequences related to difference sets |
| 627 | -- | 0 | Christian Schlegel. Evaluating distance spectra and performance bounds of trellis codes on channels with intersymbol interference |
| 634 | -- | 0 | Hirosuke Yamamoto. A coding theorem for secret sharing communication systems with two Gaussian wiretap channels |
| 638 | -- | 0 | Shirish A. Altekar, Norman C. Beaulieu. On the tightness of two error bounds for decision feedback equalizers |
| 639 | -- | 0 | Nicholas Pippenger, George D. Stamoulis, John N. Tsitsiklis. On a lower bound for the redundancy of reliable networks with noisy gates |
| 643 | -- | 0 | Tony G. Thomas, Brian L. Hughes. Exponential error bounds for random codes on Gaussian arbitrarily varying channels |
| 649 | -- | 0 | Hendrik C. Ferreira, D. A. Wright, Albertus S. J. Helberg, I. S. Shaw, C. R. Wyman. Some new rate R = k/n (2 leq k leq n-2) systematic convolutional codes with good distance profiles |
| 653 | -- | 0 | Kjell Jørgen Hole. Rate k/(k + 1) punctured convolutional encoders |
| 655 | -- | 0 | Te Sun Han, Hajime Sato. Feedback codes with uniformly bounded codeword lengths and zero-error capacities |
| 660 | -- | 0 | Patric R. J. Östergård. Upper bounds for q-ary covering codes |
| 664 | -- | 0 | Warwick de Launey. A note on N -dimensional Hadamard matrices of order 2t and Reed-Muller codes |
| 667 | -- | 0 | Alexander Vardy, Yair Be ery. More efficient soft decoding of the Golay codes |
| 672 | -- | 0 | Cheng Hua, Guo-Zhen Xiao. The linear complexity of binary sequences with period (2n-1)k |
| 673 | -- | 0 | Chong T. Ong, Cyril S. K. Leung. On the undetected error probability of triple-error-correcting BCH codes |
| 678 | -- | 0 | Gerhard J. M. van Wee, Gérard D. Cohen, Simon Litsyn. A note on perfect multiple covetings of the Hamming space |
| 682 | -- | 0 | Kenneth J. Kerpez. Runlength codes from source codes |
| 687 | -- | 0 | Raymond W. Yeung. Local redundancy and progressive bounds on the redundancy of a Huffman code |
| 691 | -- | 0 | Eric B. Hall, Gary L. Wise. On optimal estimation with respect to a large family of cost functions |
| 694 | -- | 0 | Craig Gotsman. A note on functions governed by Walsh expressions |
| 695 | -- | 0 | Jelena Kovacevic, Martin Vetterli. The commutativity of up/downsampling in two dimensions |
| 698 | -- | 0 | Ofer Zeitouni, Michael Gutman. Correction to 'On Universal Hypotheses Testing Via Large Deviations' |
| 699 | -- | 0 | Thomas J. Flynn, Robert M. Gray. Correction to Encoding of correlated observations (Nov 87 773-787) |
| 709 | -- | 711 | A. Robert Calderbank, Paul H. Siegel, Jack K. Wolf. Introduction to special issue on coding for storage devices |
| 712 | -- | 720 | Chris Heegard, Alexandra Duel-Hallen, Rajeev Krishnamoorthy. On the capacity of the noisy runlength channel |
| 721 | -- | 729 | Paul E. Bender, Jack K. Wolf. New asymptotic bounds and improvements on the Lempel-Ziv data compression algorithm |
| 730 | -- | 734 | Gilles Zémor, Gérard D. Cohen. Error-correcting WOM-codes |
| 735 | -- | 741 | Khaled A. S. Abdel-Ghaffar, Martin Hassner. Multilevel error-control codes for data storage channels |
| 742 | -- | 758 | Brian H. Marcus, Ron M. Roth. Bounds on the number of states in encoder graphs for input-constrained channels |
| 759 | -- | 777 | Chris Heegard, Brian H. Marcus, Paul H. Siegel. Variable-length state splitting with applications to average runlength-constrained (ARC) codes |
| 778 | -- | 788 | Victor D. Kolesnik, Victor Yu. Krachkovsky. Generating functions and lower bounds on rates for limited error-correcting codes |
| 789 | -- | 800 | Khaled A. S. Abdel-Ghaffar, Jacobus H. Weber. Bounds and constructions for runlength-limited error-control block codes |
| 801 | -- | 807 | Alexander Barg, Simon Litsyn. DC-constrained codes from Hadamard matrices |
| 808 | -- | 817 | Kjell Jørgen Hole. Punctured convolutional codes for the 1-D partial-response channel |
| 818 | -- | 855 | Razmik Karabed, Paul H. Siegel. Matched spectral-null codes for partial-response channels |
| 856 | -- | 862 | Henk D. L. Hollmann. The general solution of write equalization for RLL (d, k) codes |
| 863 | -- | 0 | Shlomo Shamai, Ephraim Zehavi. Bounds on the capacity of the bit-shift magnetic recording channel |
| 872 | -- | 0 | W. M. C. J. van Overveld. The four cases of write unidirectional memory codes over arbitrary alphabets |
| 878 | -- | 0 | Aaron D. Wyner, Jacob Ziv. Fixed data base version of the Lempel-Ziv data compression algorithm |
| 880 | -- | 0 | Leonid A. Bassalygo, S. I. Gelfand, Mark S. Pinsker. Coding for partially localized errors |
| 884 | -- | 0 | Rodney M. Goodman, Masahiro Sayano. The reliability of semiconductor RAM memories with on-chip error-correction coding |
| 897 | -- | 0 | Alexander A. Davydov, Leonid M. Tombak. An alternative to the Hamming code in the class of SEC-DED codes in semiconductor memory |
| 903 | -- | 0 | Yuichi Saitoh, Hideki Imai. Multiple unidirectional byte error-correcting codes |
| 908 | -- | 0 | Anthony D. Weathers, Jack K. Wolf. A new rate 2/3 sliding block code for the (1, 7) runlength constraint with the minimal number of encoder states |
| 913 | -- | 0 | Henk D. L. Hollmann, Kees A. Schouhamer Immink. Schouhamer Immink. Performance of efficient balanced codes |
| 918 | -- | 0 | Lyle J. Frederickson. On the Shannon capacity of DC- and Nyquist-free codes |
| 923 | -- | 0 | Augustus J. E. M. Janssen, Kees A. Schouhamer Immink. Entropy and power spectrum of asymmetrically DC-constrained binary sequences |
| 927 | -- | 0 | Hiroshi Kamabe. Spectral lines of codes given as functions of finite Markov chains |
| 941 | -- | 0 | Øyvind Ytrehus. Upper bounds on error-correcting runlength-limited block codes |
| 945 | -- | 0 | Mario Blaum. Combining ECC with modulation: Performance comparisons |
| 949 | -- | 0 | Gérard D. Cohen, Simon Litsyn. DC-constrained error-correcting codes with small running digital sum |
| 955 | -- | 0 | Giovanni Vannucci, Gerard J. Foschini. The minimum distance for digital magnetic recording partial responses |