default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn T. Coffey
Person information
- affiliation: Texas Instruments Inc., Santa Rosa, CA, USA
- affiliation (1989 - 2000): University of Michigan, Ann Arbor, MI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2002
[j12]Wonjin Sung, John T. Coffey:
Optimal covering polynomial sets correcting three errors for binary cyclic codes. IEEE Trans. Inf. Theory 48(4): 985-991 (2002)- 2001
- [j11]Chris Heegard, John (Seán) T. Coffey, Srikanth Gummadi, Peter A. Murphy, Ron Provencio, Eric J. Rossin, Sid Schrum, Matthew B. Shoemake:
High-performance wireless Ethernet. IEEE Commun. Mag. 39(11): 64-73 (2001) - [j10]Houshou Chen, John T. Coffey:
Trellis Structure and Higher Weights of Extremal Self-Dual Codes. Des. Codes Cryptogr. 24(1): 15-36 (2001) - 2000
- [j9]Chia-Ning Peng, Houshou Chen
, John T. Coffey, Richard G. C. Williams:
Rate gains in block-coded modulation systems with interblock memory. IEEE Trans. Inf. Theory 46(3): 851-868 (2000) - [j8]John T. Coffey, Matthew Klimesh:
Fundamental limits for information retrieval. IEEE Trans. Inf. Theory 46(7): 2281-2298 (2000) - 1997
- [j7]John T. Coffey, Aaron B. Kiely:
The capacity of coded systems. IEEE Trans. Inf. Theory 43(1): 113-127 (1997) - 1995
- [j6]Aaron B. Kiely, John T. Coffey, Mark R. Bell:
Optimal information bit decoding of linear block codes. IEEE Trans. Inf. Theory 41(1): 130-140 (1995) - 1994
- [j5]Wonjin Sung, John T. Coffey:
Decoding short binary cyclic codes via covering polynomials. Eur. Trans. Telecommun. 5(6): 653-664 (1994) - 1993
- [j4]Aaron B. Kiely, John T. Coffey:
On the capacity of a cascade of channels. IEEE Trans. Inf. Theory 39(4): 1310-1321 (1993) - 1991
- [j3]John T. Coffey, Rodney M. Goodman, Patrick Guy Farrell:
New approaches to reduced-complexity decoding. Discret. Appl. Math. 33(1-3): 43-60 (1991) - 1990
- [j2]John T. Coffey, Rodney M. Goodman:
The complexity of information set decoding. IEEE Trans. Inf. Theory 36(5): 1031-1037 (1990) - [j1]John T. Coffey, Rodney M. Goodman:
Any code of which we cannot think is good. IEEE Trans. Inf. Theory 36(6): 1453-1461 (1990)
Conference and Workshop Papers
- 1996
- [c1]I-Cheng K. Chen, John T. Coffey, Trevor N. Mudge:
Analysis of Branch Prediction Via Data Compression. ASPLOS 1996: 128-137
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-08 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
