| 1389 | -- | 1399 | Kees A. Schouhamer Immink. A practical method for approaching the channel capacity of constrained channels |
| 1400 | -- | 1411 | C. P. M. J. Baggen, Ludo M. G. M. Tolhuizen. On Diamond codes |
| 1412 | -- | 1424 | Bertrand M. Hochwald, Kenneth Zeger. Tradeoff between source and channel coding |
| 1425 | -- | 1438 | Ron M. Roth. Probabilistic crisscross error correction |
| 1439 | -- | 1451 | Tomasz Luczak, Wojciech Szpankowski. A suboptimal lossy data compression based on approximate pattern matching |
| 1452 | -- | 1464 | A. J. Wyner. The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm |
| 1465 | -- | 1476 | En-Hui Yang, Zhen Zhang, Toby Berger. Fixed-slope universal lossy data compression |
| 1477 | -- | 1488 | Norifumi Kamiya. On acceptance criterion for efficient successive errors-and-erasures decoding of Reed-Solomon and BCH codes |
| 1489 | -- | 1502 | Khaled A. S. Abdel-Ghaffar. A lower bound on the undetected error probability and strictly optimal codes |
| 1503 | -- | 1517 | Giuseppe Caire, Giorgio Taricco, Javier Ventura-Traveset, Ezio Biglieri. A multiuser approach to narrowband cellular communications |
| 1518 | -- | 1535 | Leonidas Georgiadis, Roch Guérin, Abhay K. Parekh. Optimal multiplexing on a single link: delay and buffer requirements |
| 1536 | -- | 1548 | L. K. Hansen, Guanghan Xu. A hyperplane-based algorithm for the digital co-channel communications problem |
| 1549 | -- | 1559 | Harish Viswanathan, Toby Berger. The quadratic Gaussian CEO problem |
| 1560 | -- | 1573 | José M. F. Moura, S. Goswami. Gauss-Markov random fields (CMrf) with continuous indices |
| 1574 | -- | 1587 | Yi Sun. Stochastic iterative algorithms for signal set design for Gaussian channels and optimality of the L2 signal set |
| 1588 | -- | 1593 | Judy L. Walker. The Nordstrom-Robinson code is algebraic-geometric |
| 1593 | -- | 1596 | Sami Koponen, Jyrki T. Lahtonen. On the aperiodic and odd correlations of the binary Shanbhag-Kumar-Helleseth sequences |
| 1596 | -- | 1602 | Jong-Seon No, Kyeongcheol Yang, Habong Chung, Hong-Yeop Song. New construction for families of binary sequences with optimal correlation properties |
| 1602 | -- | 1604 | Erez Petrank, Ron M. Roth. Is code equivalence easy to decide? |
| 1605 | -- | 1606 | Ludo M. G. M. Tolhuizen. The generalized Gilbert-Varshamov bound is implied by Turan s theorem [code construction] |
| 1607 | -- | 1612 | Sfefka Buyuklieva. New extremal self-dual codes of lengths 42 and 44 |
| 1613 | -- | 1616 | W. Cary Huffman. Characterization of quaternary extremal codes of lengths 18 and 20 |
| 1617 | -- | 1619 | Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Patrick Solé. Long packing and covering codes |
| 1619 | -- | 1623 | Sulaiman Al-Bassam, Ramarathnam Venkatesan, Sultan Al-Muhammadi. New single asymmetric error-correcting codes |
| 1623 | -- | 1630 | Kari J. Nurmela, Markku K. Kaikkonen, Patric R. J. Östergård. New constant weight codes from linear permutation groups |
| 1630 | -- | 1632 | Mattias Svanström. A lower bound for ternary constant weight codes |
| 1632 | -- | 1638 | T. Aaron Gulliver. Improvements to the bounds on optimal ternary linear codes of dimension 6 |
| 1639 | -- | 1647 | Alexander A. Davydov. Constructions of nonlinear covering codes |
| 1647 | -- | 1650 | Rumen N. Daskalov, T. Aaron Gulliver. New good quasi-cyclic ternary and quaternary linear codes |
| 1650 | -- | 1655 | Takeshi Hashimoto, M. Taguchi. Performance of explicit error detection and threshold decision in decoding with erasures |
| 1655 | -- | 1658 | Yunghsiang S. Han, Carlos R. P. Hartmann. The zero-guards algorithm for general minimum-distance decoding problems |
| 1658 | -- | 1662 | L. Huynh, Alistair Moffat. A probability-ratio approach to approximate binary arithmetic coding |
| 1663 | -- | 1667 | Marc P. C. Fossorier, Shu Lin. Some decomposable codes: the |a+x|b+x|a+b+x| construction |
| 1667 | -- | 1672 | Marc P. C. Fossorier, Shu Lin. Complementary reliability-based decodings of binary linear block codes |
| 1672 | -- | 1678 | Henk D. L. Hollmann. On an approximate eigenvector associated with a modulation code |
| 1678 | -- | 1681 | Lei Wei, Tor Aulin, Honghui Qi. On the effect of truncation length on the exact performance of a convolutional code |
| 1682 | -- | 1697 | Jinn-Ja Chang, Der-June Hwang, Mao Chao Lin. Some extended results on the search for good convolutional codes |
| 1697 | -- | 1706 | Marcelo J. Weinberger, Gadiel Seroussi. Sequential prediction and ranking in universal context modeling and data compression |
| 1714 | -- | 1716 | Milan M. Milosavljevic, Milutin R. Dostanic. On generalized stable nonuniform sampling expansions involving derivatives |
| 1717 | -- | 1721 | A. I. Zayed, A. G. Garcia. Nonuniform sampling of bandlimited signals with polynomial growth on the real axis |
| 1721 | -- | 1724 | Peter L. Bartlett, Sanjeev R. Kulkarni, S. E. Posner. Covering numbers for real-valued function classes |
| 1725 | -- | 1736 | Alex J. Grant, Christian Schlegel. Collision-type multiple-user communications |
| 1736 | -- | 1740 | H. Herzberg. On the spectrum of distances of a multilevel code, decoded by a multistage decoder |
| 1740 | -- | 1747 | Xian-Mo Zhang, Yuliang Zheng. Cryptographically resilient functions |
| 1747 | -- | 0 | Marcel van der Vlugt. Addendum to Non-BCH triple-error-correcting codes |