Finding Pseudo-codewords on Computation Tree and Graph-covers
碩士 === 國立中正大學 === 通訊工程研究所 === 94 === Earlier work of LDPC codes showed that Tanner graph mainly affects the decoding performance of iterative decoding. Pseudo-codewords and pseudo-weights on Tanner graph are found playing an important rule in determining the performance. Computation tree and graph c...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/61628557325159083614 |