Minimal tail-biting trellises: the Golay code and more
IEEE Transactions on Information Theory
The generalized distributive law
IEEE Transactions on Information Theory
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Codes on graphs: normal realizations
IEEE Transactions on Information Theory
| Hi-index | 0.01 |
There is intense current interest in the subject of "codes on graphs." Graphical models for codes arise from state realizations. Normal realizations may be assumed without loss of generality. A normal realization has a dual which necessarily generates the dual code. Conventional trellises and tail-biting realizations are inherently normal. Efficient realizations of Reed-Muller codes are presented. Low-density parity-check codes use generic parity-check realizations. Algebraic tools may improve such graph-based codes.