 | 2012 |
| 9 |  | Thomas R. Halford,
Keith M. Chugg,
Marcus T. Urie:
Conditionally Cycle-Free Graphical Models for Coset Codes.
IEEE Transactions on Information Theory 58(1): 64-77 (2012) |
| 2010 |
| 8 |  | Thomas R. Halford,
Keith M. Chugg,
Andreas Polydoros:
Barrage relay networks: System & protocol design.
PIMRC 2010: 1133-1138 |
| 2008 |
| 7 |  | Thomas R. Halford,
Keith M. Chugg:
Transactions Letters - Random Redundant Iterative Soft-in Soft-out Decoding.
IEEE Transactions on Communications 56(4): 513-517 (2008) |
| 6 |  | Thomas R. Halford,
Keith M. Chugg:
The Extraction and Complexity Limits of Graphical Models for Linear Codes.
IEEE Transactions on Information Theory 54(9): 3884-3906 (2008) |
| 2006 |
| 5 |  | Thomas R. Halford,
Keith M. Chugg:
The Extraction and Complexity Limits of Graphical Models for Linear Codes
CoRR abs/cs/0611089: (2006) |
| 4 |  | 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) |
| 3 |  | Thomas R. Halford,
Keith M. Chugg:
An algorithm for counting short cycles in bipartite graphs.
IEEE Transactions on Information Theory 52(1): 287-292 (2006) |
| 2 |  | Thomas R. Halford,
Alex J. Grant,
Keith M. Chugg:
Which Codes Have 4-Cycle-Free Tanner Graphs?
IEEE Transactions on Information Theory 52(9): 4219-4223 (2006) |
| 2005 |
| 1 |  | 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 Transactions on Information Theory 51(12): 4363-4368 (2005) |