| Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds | 6 | 0.50 | 2008 |
| Improved Upper Bounds on the Reliability Function of the Gaussian Channel | 6 | 0.69 | 2008 |
| Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity | 11 | 0.86 | 2007 |
| Efficient Serial Message-Passing Schedules for LDPC Decoding | 58 | 2.64 | 2007 |
| Improved decoding of LDPC coded modulations | 7 | 1.16 | 2006 |
| Discrete and continuous maxima in multicarrier communication | 17 | 1.21 | 2005 |
| Lattices which are good for (almost) everything | 164 | 8.75 | 2005 |
| Simple MAP decoding of first-order Reed-Muller and Hamming codes | 23 | 1.63 | 2004 |
| Intersecting codes and separating codes | 14 | 0.86 | 2003 |
| Upper bounds on the rate of LDPC codes | 36 | 3.01 | 2002 |
| On ensembles of low-density parity-check codes: asymptotic distance distributions | 69 | 6.07 | 2002 |
| Estimates of the distance distribution of codes and designs | 14 | 1.04 | 2001 |
| An improved upper bound on the minimum distance of doubly-even self-dual codes | 7 | 2.18 | 2000 |
| Asymptotically exact bounds on the size of high-order spectral-null codes | 4 | 0.95 | 1999 |
| More on the distance distribution of BCH codes | 8 | 0.71 | 1999 |
| Upper bounds on the size of quantum codes | 33 | 4.52 | 1999 |
| On binary constructions of quantum codes | 29 | 2.70 | 1999 |
| New upper bounds on error exponents | 30 | 2.85 | 1999 |
| On the distance distribution of duals of BCH codes | 4 | 0.45 | 1999 |
| Codes correcting phased burst erasures | 4 | 0.46 | 1998 |
| Several new lower bounds on the size of codes with covering radius one | 6 | 0.91 | 1998 |
| A class of array codes correcting multiple column erasures | 9 | 0.64 | 1997 |
| Long packing and covering codes | 4 | 0.66 | 1997 |
| Parameters of Goppa codes revisited | 3 | 0.46 | 1997 |
| Linear programming bounds for doubly-even self-dual codes | 2 | 0.61 | 1997 |
| Estimates for the range of binomiality in codes' spectra | 8 | 0.87 | 1997 |
| Upper bounds on the covering radius of a code with a given dual distance | 11 | 0.77 | 1996 |
| More on the covering radius of BCH codes | 5 | 0.49 | 1996 |
| On the traveling salesman problem in binary Hamming spaces | 1 | 0.35 | 1996 |
| On the accuracy of the binomial approximation to the distance distribution of codes | 7 | 0.76 | 1995 |
| Error-correcting codes with bounded running digital sum | 2 | 0.55 | 1993 |
