A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf
.
Tanner graphs for group block codes and lattices: construction and complexity
2001
IEEE Transactions on Information Theory
We develop a Tanner graph (TG) construction for an Abelian group block code with arbitrary alphabets at different coordinates, an important application of which is the representation of the label code of a lattice. The construction is based on the modular linear constraints imposed on the code symbols by a set of generators for the dual code . As a necessary step toward the construction of a TG for , we devise an efficient algorithm for finding a generating set for . In the process, we develop
doi:10.1109/18.910592
fatcat:a2wl44cfobcf3g2rdtq5zshnpa