default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas R. Halford
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j8]Thomas A. Courtade
, Thomas R. Halford:
Coded Cooperative Data Exchange for a Secret Key. IEEE Trans. Inf. Theory 62(7): 3785-3795 (2016)- [c15]Salvatore Talarico, Matthew C. Valenti, Thomas R. Halford:
Controlled barrage regions: Stochastic modeling, analysis, and optimization. MILCOM 2016: 466-472 - [i5]Salvatore Talarico, Matthew C. Valenti, Thomas R. Halford:
Controlled Barrage Regions: Stochastic Modeling, Analysis, and Optimization. CoRR abs/1610.08173 (2016) - 2015
- [j7]Thomas R. Halford, Thomas A. Courtade, Keith M. Chugg, Xiaochen Li, Gautam Thatte:
Energy-Efficient Group Key Agreement for Wireless Networks. IEEE Trans. Wirel. Commun. 14(10): 5552-5564 (2015) - 2014
- [c14]Michael P. Fitz, Thomas R. Halford, Iftekhar Hossain, Scott Enserink:
Towards simultaneous radar and spectral sensing. DySPAN 2014: 15-19 - [c13]Scott Enserink, Michael P. Fitz, Changyi Gu, Thomas R. Halford, Iftekhar Hossain, Sungill Kim, Oscar Y. Takeshita:
Joint Analog and Digital Interference Cancellation. DySPAN 2014: 378-379 - [c12]Thomas A. Courtade, Thomas R. Halford:
Coded cooperative data exchange for a secret key. ISIT 2014: 776-780 - [c11]Salvatore Talarico, Matthew C. Valenti, Thomas R. Halford:
Unicast Barrage Relay Networks: Outage Analysis and Optimization. MILCOM 2014: 537-543 - [i4]Thomas A. Courtade, Thomas R. Halford:
Coded Cooperative Data Exchange for a Secret Key. CoRR abs/1407.0333 (2014) - [i3]Salvatore Talarico, Matthew C. Valenti, Thomas R. Halford:
Unicast Barrage Relay Networks: Outage Analysis and Optimization. CoRR abs/1408.5928 (2014) - 2013
- [c10]Thomas R. Halford, Thomas A. Courtade, Keith M. Chugg:
Energy-efficient, secure group key agreement for ad hoc networks. CNS 2013: 181-188 - [c9]Thomas R. Halford:
How to Prove Yourself to Multiple Parties: Energy-Efficient Multi-group Authentication. MILCOM 2013: 237-242 - [c8]Thomas R. Halford:
Secure Many-to-Some Communications. MILCOM 2013: 243-247 - 2012
- [j6]Thomas R. Halford, Keith M. Chugg, Marcus T. Urie:
Conditionally Cycle-Free Graphical Models for Coset Codes. IEEE Trans. Inf. Theory 58(1): 64-77 (2012) - [c7]Thomas R. Halford, Thomas A. Courtade, Kurt A. Turck:
The user capacity of barrage relay networks. MILCOM 2012: 1-6 - 2011
- [c6]Thomas R. Halford, Keith M. Chugg:
The stability of multihop transport with autonomous cooperation. MILCOM 2011: 1023-1028 - 2010
- [c5]Thomas R. Halford, Keith M. Chugg:
Barrage Relay Networks. ITA 2010: 153-160 - [c4]Thomas R. Halford, Keith M. Chugg, Andreas Polydoros:
Barrage relay networks: System & protocol design. PIMRC 2010: 1133-1138
2000 – 2009
- 2008
- [j5]Thomas R. Halford, Keith M. Chugg:
Transactions Letters - Random Redundant Iterative Soft-in Soft-out Decoding. IEEE Trans. Commun. 56(4): 513-517 (2008) - [j4]Thomas R. Halford, Keith M. Chugg:
The Extraction and Complexity Limits of Graphical Models for Linear Codes. IEEE Trans. Inf. Theory 54(9): 3884-3906 (2008) - 2007
- [c3]Thomas R. Halford, Keith M. Chugg:
Conditionally Cycle-Free Generalized Tanner Graphs: Theory and Application to High-Rate Serially Concatenated Codes. ISIT 2007: 1881-1885 - 2006
- [j3]Thomas R. Halford, Keith M. Chugg:
An algorithm for counting short cycles in bipartite graphs. IEEE Trans. Inf. Theory 52(1): 287-292 (2006) - [j2]Thomas R. Halford, Alex J. Grant, Keith M. Chugg:
Which Codes Have 4-Cycle-Free Tanner Graphs? IEEE Trans. Inf. Theory 52(9): 4219-4223 (2006) - [c2]Thomas R. Halford, Keith M. Chugg, Alex J. Grant:
Which Codes Have 4-Cycle-Free Tanner Graphs? ISIT 2006: 871-875 - [c1]Thomas R. Halford, Keith M. Chugg:
Random Redundant Soft-In Soft-Out Decoding of Linear Block Codes. ISIT 2006: 2230-2234 - [i2]Thomas R. Halford, Keith M. Chugg:
The Extraction and Complexity Limits of Graphical Models for Linear Codes. CoRR abs/cs/0611089 (2006) - [i1]Thomas R. Halford, Keith M. Chugg:
Conditionally Cycle-Free Generalized Tanner Graphs: Theory and Application to High-Rate Serially Concatenated Codes. CoRR abs/cs/0611097 (2006) - 2005
- [j1]Thomas R. Halford, V. Ponnampalam, Alexander J. Grant, Keith M. Chugg:
Soft-in soft-out decoding of Reed-Solomon codes based on Vardy and Be'ery's decomposition. IEEE Trans. Inf. Theory 51(12): 4363-4368 (2005)
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 2024-04-24 23:20 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:
