|
Search the dblp DataBase
Thomas R. Halford:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Thomas R. Halford, Keith M. Chugg
An algorithm for counting short cycles in bipartite graphs. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:1, pp:287-292 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:12, pp:4363-4368 [Journal]
- Thomas R. Halford, Alex J. Grant, Keith M. Chugg
Which Codes Have 4-Cycle-Free Tanner Graphs? [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:9, pp:4219-4223 [Journal]
- Thomas R. Halford, Keith M. Chugg
The Extraction and Complexity Limits of Graphical Models for Linear Codes [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
- Thomas R. Halford, Keith M. Chugg
Conditionally Cycle-Free Generalized Tanner Graphs: Theory and Application to High-Rate Serially Concatenated Codes [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
Search in 0.001secs, Finished in 0.001secs
|