Computational Problems In Codes On Graphs
Two standard graph representations for linear codes are the Tanner graph and the tailbiting trellis. Such graph representations allow the decoding problem for a code to be phrased as a computational problem on the corresponding graph and yield graph theoretic criteria for good codes. When a Tanner g...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2005/487 |