John T. Coffey

12 papers A* 1Journal 11
YearRankTypeTitle / Venue / Authors
2002 J jnl
Optimal covering polynomial sets correcting three errors for binary cyclic codes.
IEEE Trans. Inf. Theory
Wonjin Sung, John T. Coffey
2001 J jnl
Trellis Structure and Higher Weights of Extremal Self-Dual Codes.
Des. Codes Cryptogr.
Houshou Chen, John T. Coffey
2000 J jnl
Fundamental limits for information retrieval.
IEEE Trans. Inf. Theory
John T. Coffey, Matthew Klimesh
2000 J jnl
Rate gains in block-coded modulation systems with interblock memory.
IEEE Trans. Inf. Theory
Chia-Ning Peng, Houshou Chen, John T. Coffey, Richard G. C. Williams
1997 J jnl
The capacity of coded systems.
IEEE Trans. Inf. Theory
John T. Coffey, Aaron B. Kiely
1996 A* conf
Analysis of Branch Prediction Via Data Compression.
ASPLOS
I-Cheng K. Chen, John T. Coffey, Trevor N. Mudge
1995 J jnl
Optimal information bit decoding of linear block codes.
IEEE Trans. Inf. Theory
Aaron B. Kiely, John T. Coffey, Mark R. Bell
1994 J jnl
Decoding short binary cyclic codes via covering polynomials.
Eur. Trans. Telecommun.
Wonjin Sung, John T. Coffey
1993 J jnl
On the capacity of a cascade of channels.
IEEE Trans. Inf. Theory
Aaron B. Kiely, John T. Coffey
1991 J jnl
New approaches to reduced-complexity decoding.
Discret. Appl. Math.
John T. Coffey, Rodney M. Goodman, Patrick Guy Farrell
1990 J jnl
Any code of which we cannot think is good.
IEEE Trans. Inf. Theory
John T. Coffey, Rodney M. Goodman
1990 J jnl
The complexity of information set decoding.
IEEE Trans. Inf. Theory
John T. Coffey, Rodney M. Goodman