Sufficient conditions for convergence of the sum-product decoding (情報セキュリティ)
スポンサーリンク
概要
- 論文の詳細を見る
Recently, Mooij et al. proposed sufficient conditions for convergence of the sum-product algorithm, which was stated as the upper bound for the spectral radius of a matrix defined by a probability distribution under consideration. In this paper, we adapt Mooij's sufficient conditions to the decoding problem, and derive a sufficient condition for convergence of the sum-product decoding.
- 社団法人電子情報通信学会の論文
- 2009-03-02
著者
関連論文
- Encoding of Linear Codes Based on the Rearrangement of Block-Triangularized Parity-Check Matrices
- On Generalized Hamming Weights of Codes Constructed on Affine Algebraic Varieties (Special Section on Information Theory and Its Applications)
- An Improved Bound for the Dimension of Subfield Subcodes
- Multi-edge type LDPC code ensembles with exponentially few codewords of linear small weight (情報理論)
- A note on analytical solution of covariance evolution for regular LDPC codes (情報理論)
- On the Performance of Algebraic Geometric Codes
- A Lower Bound for Generalized Hamming Weights and a Condition for t-th Rank MDS
- On the size of circulant matrices for which reversible codes exist (ワイドバンドシステム)
- Construction of Cyclic Codes Suitable for Iterative Decoding via Generating Idempotents
- Characterization of Factor Graph by Mooij's Sufficient Condition for Convergence of the Sum-Product Algorithm
- Sufficient conditions for convergence of the sum-product decoding (情報理論)
- On the size of circulant matrices for which reversible codes exist (情報処理)
- Sufficient conditions for convergence of the sum-product decoding (情報セキュリティ)
- On the size of circulant matrices for which reversible codes exist (情報セキュリティ)
- Sufficient conditions for convergence of the sum-product decoding (ワイドバンドシステム)
- Ring Theoretic Approach to Reversible Codes Based on Circulant Matrices
- On the dependence of error performance of spatially coupled LDPC codes on their design parameters
- On the Dependence of Error Performance of Spatially Coupled LDPC Codes on Their Design Parameters