Title :
On Tanner graphs of lattices and codes
Author :
Banihashemi, Amir H. ; Kschischang, Frank R. ; Gulak, P. Glenn
Author_Institution :
Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada
Abstract :
The problem of finding a low-complexity Tanner graph for a general lattice Λ is studied. The problem is divided into two subproblems: (1) Finding an orthogonal sublattice Λ´ of Λ which minimizes the complexity of the label code of the quotient group Λ/Λ´. (2) Constructing a simple Tanner graph for the label code obtained in part 1. The proposed approach for solving subproblem 2 can also be applied to any abelian group block code with arbitrary finite alphabets at different coordinates. The results of this work are useful in finding low-complexity graph representation of lattices and codes, which consequently results in efficient graph-based decoding algorithms
Keywords :
block codes; codes; decoding; graph theory; lattice theory; abelian group block code; codes; graph representation; graph-based decoding algorithms; label code complexity; lattices; low-complexity Tanner graph; orthogonal sublattice; quotient group; Artificial intelligence; Bipartite graph; Block codes; Decoding; Equations; Lattices; Parity check codes; Virtual colonoscopy;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708704
