The complexity of information set decoding. - John T. Coffey; Rodney M. Goodman (IEEE Trans. Inf. Theory, 1990)

Any code of which we cannot think is good. - John T. Coffey; Rodney M. Goodman (IEEE Trans. Inf. Theory, 1990)

New approaches to reduced-complexity decoding. - John T. Coffey; Rodney M. Goodman; Patrick Guy Farrell (Discret. Appl. Math., 1991)

On the capacity of a cascade of channels. - Aaron B. Kiely; John T. Coffey (IEEE Trans. Inf. Theory, 1993)

Decoding short binary cyclic codes via covering polynomials. - Wonjin Sung; John T. Coffey (Eur. Trans. Telecommun., 1994)

Optimal information bit decoding of linear block codes. - Aaron B. Kiely; John T. Coffey; Mark R. Bell (IEEE Trans. Inf. Theory, 1995)

Analysis of Branch Prediction Via Data Compression. - I-Cheng K. Chen; John T. Coffey; Trevor N. Mudge (ASPLOS, 1996)

The capacity of coded systems. - John T. Coffey; Aaron B. Kiely (IEEE Trans. Inf. Theory, 1997)

Fundamental limits for information retrieval. - John T. Coffey; Matthew Klimesh (IEEE Trans. Inf. Theory, 2000)

Rate gains in block-coded modulation systems with interblock memory. - Chia-Ning Peng; Houshou Chen; John T. Coffey; Richard G. C. Williams (IEEE Trans. Inf. Theory, 2000)

High-performance wireless Ethernet. - Chris Heegard; John (Seán) T. Coffey; Srikanth Gummadi; Peter A. Murphy; Ron Provencio; Eric J. Rossin; Sid Schrum; Matthew B. Shoemake (IEEE Commun. Mag., 2001)

Trellis Structure and Higher Weights of Extremal Self-Dual Codes. - Houshou Chen; John T. Coffey (Des. Codes Cryptogr., 2001)

Optimal covering polynomial sets correcting three errors for binary cyclic codes. - Wonjin Sung; John T. Coffey (IEEE Trans. Inf. Theory, 2002)