On the size of circulant matrices for which reversible codes exist (ワイドバンドシステム)
スポンサーリンク
概要
- 論文の詳細を見る
Recently, Haley and Grant introduced the concept of reversible codes - a class of linear codes encodable by the iterative message-passing algorithm based on the Jacobi method over F_2. They also developed a concrete procedure to construct parity check matrices of reversible codes by utilizing some properties of circulant matrices which is described in terms of polynomials over F_2. In this paper, we investigate the size of circulant matrices considered in the Haley's procedure and clarify the necessary and sufficient condition on the size for which reversible codes based on circulant matrices exist. This condition tells us that no reversible codes based on circulant matrices exist other than those constructed by the Haley's procedure.
- 2010-02-25
著者
-
Shibuya Tomoharu
Department of Information and Communication Sciences, Sophia University
-
Shibuya Tomoharu
Department Of Information And Communication Sciences Sophia University
-
Shibuya Tomoharu
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Nakade Keita
Department of Information and Communication Sciences, Sophia University
-
Nakade Keita
Department Of Information And Communication Sciences Sophia University
関連論文
- 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