| 2002 |
|---|
| 11 | | Wonjin Sung,
John T. Coffey:
Optimal covering polynomial sets correcting three errors for binary cyclic codes.
IEEE Transactions on Information Theory 48(4): 985-991 (2002) |
| 2001 |
|---|
| 10 | | Houshou Chen,
John T. Coffey:
Trellis Structure and Higher Weights of Extremal Self-Dual Codes.
Des. Codes Cryptography 24(1): 15-36 (2001) |
| 2000 |
|---|
| 9 | | Chia-Ning Peng,
Houshou Chen,
John T. Coffey,
Richard G. C. Williams:
Rate gains in block-coded modulation systems with interblock memory.
IEEE Transactions on Information Theory 46(3): 851-868 (2000) |
| 8 | | John T. Coffey,
Matthew Klimesh:
Fundamental limits for information retrieval.
IEEE Transactions on Information Theory 46(7): 2281-2298 (2000) |
| 1997 |
|---|
| 7 | | John T. Coffey,
Aaron B. Kiely:
The capacity of coded systems.
IEEE Transactions on Information Theory 43(1): 113-127 (1997) |
| 1996 |
|---|
| 6 | | I-Cheng K. Chen,
John T. Coffey,
Trevor N. Mudge:
Analysis of Branch Prediction Via Data Compression.
ASPLOS 1996: 128-137 |
| 1995 |
|---|
| 5 | | Aaron B. Kiely,
John T. Coffey,
Mark R. Bell:
Optimal information bit decoding of linear block codes.
IEEE Transactions on Information Theory 41(1): 130-140 (1995) |
| 1993 |
|---|
| 4 | | Aaron B. Kiely,
John T. Coffey:
On the capacity of a cascade of channels.
IEEE Transactions on Information Theory 39(4): 1310-1321 (1993) |
| 1991 |
|---|
| 3 | EE | John T. Coffey,
Rodney M. Goodman,
Patrick G. Farrell:
New approaches to reduced-complexity decoding.
Discrete Applied Mathematics 33(1-3): 43-60 (1991) |
| 1990 |
|---|
| 2 | | John T. Coffey,
Rodney M. Goodman:
The complexity of information set decoding.
IEEE Transactions on Information Theory 36(5): 1031-1037 (1990) |
| 1 | | John T. Coffey,
Rodney M. Goodman:
Any code of which we cannot think is good.
IEEE Transactions on Information Theory 36(6): 1453- (1990) |
