On the Minimum Weight of Simple Full-Length Array LDPC Codes
スポンサーリンク
概要
- 論文の詳細を見る
We investigate the minimum weights of simple full-length array LDPC codes (SFA-LDPC codes). The SFA-LDPC codes are a subclass of LDPC codes, and constructed algebraically according to two integer parameters p and j. Mittelholzer and Yang et al. have studied the minimum weights of SFA-LDPC codes, but the exact minimum weights of the codes are not known except for some small p and j. In this paper, we show that the minimum weights of the SFA-LDPC codes with j=4 and j=5 are upper-bounded by 10 and 12, respectively, independent from the prime number p. By combining the results with Yangs lower-bound limits, we can conclude that the minimum weights of the SFA-LDPC codes with j=4 and p>7 are exactly 10 and those of the SFA-LDPC codes with j=5 are 10 or 12.
- 2008-06-01
著者
-
Sugiyama Kenji
Graduate School Of Engineering Seikei University
-
Sugiyama Kenji
Seikei Univ. Musashino‐shi Jpn
-
Kaji Yuichi
Graduate School Of Information Science Nara Institute Of Science And Technology
関連論文
- IMPROVEMENT OF I-PICTURE CODING USING INTER-PICTURE PROCESSING(International Workshop on Advanced Image Technology 2009)
- ADAPTIVE INTERPOLATION CONSIDERING WITH SUBJECTIVE PICTURE QUALITY(International Workshop on Advanced Image Technology 2009)
- Estimation of Mosquito Noise Level from Decoded Picture
- On the Minimum Weight of Simple Full-Length Array LDPC Codes
- ABSOLUTE ESTIMATION METHOD OF MOSQUITO NOISE FOR A POST FILTERLING(International Workshop on Advanced Image Technology 2009)
- Adaptive Recursive Maximum Likelihood Decoding Based on the Coarsest Parallel Concatenation Decomposition : Evaluation of the Decoding Complexity by Simulation
- DE-INTERLACING METHOD USING RECURSIVE AND BI-DIRECTIONAL INTER-FIELD INTERPOLATION(International Workshop on Advanced Image Technology 2006)
- RIGHT-LINEAR FINITE PATH OVERLAPPING REWRITE SYSTEMS EFFECTIVELY PRESERVE RECOGNIZABILITY
- Syntactic Unification Problems under Constrained Substitutions
- Two-dimensional barcode system with extreme density : some investigation on the error correcting mechanism
- Secure, Efficient and Practical Key Management Scheme in the Complete-Subtree Method(Application)(Cryptography and Information Security)
- Key Predistribution Schemes for Sensor Networks Using Finite Plane Geometry
- Using Trapdoor Permutations in a Complete Subtree Method for Broadcast Encryption(Information Security)
- Maximum Likelihood Decoding for Linear Block Codes Using Grobner Bases
- Linearity Improvement of Mosquito Noise Level Estimation from Decoded Picture
- A Soft-Decision MLD Algorithm for Linear Block Codes Using Grobner Bases
- Decoding Linear Block Codes Using the Ordered Statistics and MLD Techniques
- A Call-by-Need Recursive Algorithm for the LogMAP Decoding of a Binary Linear Block Code(Information Theory)
- A Call-by-Need Recursive Algorithm for the LogMAP Decoding of a Linear Block Code
- A Call-by-Need Recursive Algorithm for the LogMAP Decoding of a Binary Linear Block Code
- Non-reference Quality Estimation for Temporal Degradation of Coded Picture
- Encoding LDPC Codes Using the Triangular Factorization(Coding Theory,Information Theory and Its Applications)
- The Expected Write Deficiency of Index-Less Indexed Flash Codes
- Uniform-Compartment Flash Code and Binary-Indexed Flash Code
- Flash Code Utilizing Binary-Indexed Slice Encoding and Resizable-Clusters
- Multi-Mode Encoding with Binary-Indexed Flash Code