The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

John T. Coffey: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  11. New approaches to reduced-complexity decoding. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002