John T. Coffey

According to our database, John T. Coffey authored at least 12 papers between 1990 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2002

Optimal covering polynomial sets correcting three errors for binary cyclic codes.

Wonjin Sung, John T. Coffey

IEEE Trans. Inf. Theory, 2002

2001

Trellis Structure and Higher Weights of Extremal Self-Dual Codes.

Houshou Chen, John T. Coffey

Des. Codes Cryptogr., 2001

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

Fundamental limits for information retrieval.

John T. Coffey, Matthew Klimesh

IEEE Trans. Inf. Theory, 2000

1997

The capacity of coded systems.

John T. Coffey, Aaron B. Kiely

IEEE Trans. Inf. Theory, 1997

1996

Analysis of Branch Prediction Via Data Compression.

I-Cheng K. Chen, John T. Coffey, Trevor N. Mudge

Proceedings of the ASPLOS-VII Proceedings, 1996

1995

Optimal information bit decoding of linear block codes.

Aaron B. Kiely, John T. Coffey, Mark R. Bell

IEEE Trans. Inf. Theory, 1995

1994

Decoding short binary cyclic codes via covering polynomials.

Wonjin Sung, John T. Coffey

Eur. Trans. Telecommun., 1994

1993

On the capacity of a cascade of channels.

Aaron B. Kiely, John T. Coffey

IEEE Trans. Inf. Theory, 1993

1991

New approaches to reduced-complexity decoding.

John T. Coffey, Rodney M. Goodman, Patrick Guy Farrell

Discret. Appl. Math., 1991

1990

Any code of which we cannot think is good.

John T. Coffey, Rodney M. Goodman

IEEE Trans. Inf. Theory, 1990

The complexity of information set decoding.

John T. Coffey, Rodney M. Goodman

IEEE Trans. Inf. Theory, 1990