Maximum Likelihood Decoding for Linear Block Codes Using Grobner Bases
スポンサーリンク
概要
- 論文の詳細を見る
New algorithms for the soft-derision and the hard-derision maximum likelihood decoding (MLD) for binary linear block codes are proposed. It has been widely known that both MLD can be regarded as an integer programming with binary arithmetic conditions. Recently, Conti and Traverso have proposed an efficient algorithm which uses Grobner bases to solve integer programming with ordinary integer arithmetic conditions. In this paper, the Conti-Traverso algorithm is extended to solve integer programming with modulo arithmetic conditions. We also show how to transform the soft-decision and the hard-decision MLD to integer programming for which the extended Conti-Traverso algorithm is applicable.
- 社団法人電子情報通信学会の論文
- 2003-03-01
著者
-
Kaji Yuichi
Graduate School Of Information Science Nara Institute Of Science And Technology
-
IKEGAMI Daisuke
Graduate School of Information Science,Nara Institute of Science and Technology
-
Ikegami Daisuke
Graduate School Of Information Science Nara Institute Of Science And Technology
-
KAJI Yuichi
Graduate School of Information Science,Nara Institute of Science and Technology
関連論文
- On the Minimum Weight of Simple Full-Length Array LDPC Codes
- Adaptive Recursive Maximum Likelihood Decoding Based on the Coarsest Parallel Concatenation Decomposition : Evaluation of the Decoding Complexity by Simulation
- 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
- 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
- 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