Hypertrellis Decoding / Factorization Hypergraph / Tanner or Factor Graph

1. W.H. Mow, "Hypertrellis: a Generalization of Trellis and Factor Graph", 1999 IMA Workshop on Codes, Systems and Graphical Models, Minneapolis, USA, August 2-13, 1999. Available at http://www.ima.umn.edu/talks/workshops/aug2-13.99/8-2-13.99.html.

2. W.H. Mow, "Fully Parallel Iterative Decoder on Hypertrellis via Add-Min-Add Operations", Proc. 2000 International Symposium on Information Theory and its Applications (ISITA'2000), Honolulu, Hawaii, USA, November 5-8, 2000, pp. 42-45.

3. K.C. Chew and W.H. Mow, "Iterative Decoding of Turbo Single-Parity-Check-Based Tree Codes via Belief Propagation", Proc. 2000 IEEE Singapore International Conference on Communication Systems (ICCS'2000), Singapore, November 20-24, 2000.

4. W.H. Mow, "Maximum Likelihood Decoding as a Shortest Hyperpath Search on Hypertrellises", Proc. 2000 IEEE International Symposium on Information Theory (ISIT'2000), Recent Result Session, Sorrento, Italy, June 25-30, 2000.

5. W.H. Mow, "Hypertrellis: a Generalization of Trellis and Factor Graph", Codes, Systems, and Graphical Models, IMA Volumes in Mathematics and its Applications, Vol. 123, edited by B. Marcus and J. Rosenthal, Springer-Verlag, ISBN 0-387-95173-3, Jan. 2001, pp. 167-194.

6. Zong-Qi Hu, Wai Ho Mow, and Wing-Hung Ki, "Analog Integrated Circuit Design of a Hypertrellis Decoder", Proc. International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'03), Chengdu, China, 27-29 Aug. 2003, pp.552-556.

7. Edward K. Au, Wai Ho Mow  and Wing-Hung Ki, "Hypergraph: An alternative graphical model for computing transfer functions in circuits and systems", Proc. 2005 International Conference on Communications, Circuits and Systems (ICCCAS'05), Hong Kong, May 27-30, 2005.