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: | Wei-yu Hsu, 徐偉峪 |
---|---|
Other Authors: | Hsiao-feng Lu |
Format: | Others |
Language: | en_US |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/61628557325159083614 |
Similar Items
-
Iterative decoding and pseudo-codewords
by: Horn, Gavin B.
Published: (1999) -
CODEWORDS CORRECTION ON THE BASIS OF PARITY CHECKS
by: A. S. Poljakov, et al.
Published: (2019-06-01) -
Codewords generated by UP-valued functions
by: Ronnason Chinram, et al.
Published: (2021-03-01) -
Codeword-Based Linux Virus Detection Using Virus Features
by: Chia-Yi Hsu, et al.
Published: (2005) -
Codeword Structure Analysis for LDPC Convolutional Codes
by: Hua Zhou, et al.
Published: (2015-12-01)