On the Minimum Distance of Concatenated Codes and Decoding Method up to the True Minimum Distance
スポンサーリンク
概要
- 論文の詳細を見る
Condatenated codes have many remarkable properties from both the theoretical and practical viewpoints. The minimum distance of a concatenated code is at least the product of the minimum distances of an outer code and an inner code. In this paper, we shall examine some cases that the minimum distance of concatenated codes is beyond the lower bound and get the tighter bound or the true minimum distance of concatenated codes by using the complete weight enumerator of the outer code and the Hamming weight enumerator of the inner code. Furthermore we propose a new decoding method based on Reddy-Robinson algorithm by using the decoding method beyond the BCH bound.
- 社団法人電子情報通信学会の論文
- 1997-11-25
著者
-
Hirasawa S
Waseda Univ. Tokyo Jpn
-
Hirasawa S
School Of Science And Engineering Waseda University
-
Hirasawa Shigeichi
The Department Of Industrial And Management Systems Engineering Waseda University
-
KOHNOSU Toshiyuki
the Department of Industrial and Management Systems Engineering, Waseda University
-
NISHIJIMA Toshihisa
The author is with Department of Industrial and Systems Engineering, Hosei University
-
Hirasawa S
Department Of The Industrial And Management Systems Engineering School Of Science And Engineering Wa
-
Nishijima T
Hosei Univ. Tokyo Jpn
関連論文
- On the Minimum Distance of Concatenated Codes and Decoding Method up to the True Minimum Distance
- On the Minimum Distance of Binary Concatenated Codes
- Parallel Propagation Algorithms for Tailbiting Convolutional Codes
- Parallel Architecture for Generalized LFSR in LSI Built-In Self Testing
- Adaptive Decoding Algorithms for Low-Density Parity-Check Codes over the Binary Erasure Channel
- Fingerprinting Codes for Multimedia Data against Averaging Attack
- A Combined Matrix Ensemble of Low-Density Parity-Check Codes for Correcting a Solid Burst Erasure
- Density Evolution Analysis of Robustness for LDPC Codes over the Gilbert-Elliott Channel
- A Generalization of the Parallel Error Correcting Codes by Allowing Some Random Errors(Information Theory and Its Applications)
- On Correctable Burst-Erasure Lengths for LDPC Codes with Column Permuted Parity-Check Matrices
- Decoding Performance of Linear Parallel Error Correcting Codes
- Fast Algorithm for Generating Candidate Codewords in Reliability-Based Maximum Likelihood Decoding(Coding Theory,Information Theory and Its Applications)
- A Modification Method for Constructing Low-Density Parity-Check Codes for Burst Erasures(Coding Theory,Information Theory and Its Applications)
- A New Class of Traceability Codes for Digital Fingerprinting(HISC2006)
- A Heuristic Search Algorithm with the Reduced List of Test Error Patterns for Maximum Likelihood Decoding
- A Heuristic Search Method with the Reduced List of Test Error Patterns for Maximum Likelihood Decoding(Coding Theory, Information Theory and Its Applications)
- Fast Algorithm for Generating Candidate Codewords in Reliability-based Maximum Likelihood Decoding
- An Improved Method of Reliability-Based Maximum Likelihood Decoding Algorithms Using an Order Relation among Binary Vectors(Coding Theory)(Information Theory and Its Applications)
- A Method for Reducing Space Complexity of Reliability based Heuristic Search Maximum Likelihood Decoding Algorithms
- Complexity Reduction of the Gazelle and Snyders Decoding Algorithm for Maximum Likelihood Decoding(Coding Theory)(Information Theory and Its Applications)
- Almost Sure and Mean Convergence of Extended Stochastic Complexity (Special Section on Information Theory and Its Applications)
- A Generalization of B.S. Clarke and A.R. Barron's Asymptotics of Bayes Codes for FSMX Sources (Special Section on Information Theory and Its Applications)
- Properties of a Word-Valued Source with a Non-prefix-free Word Set(Information Theory)
- A Source Model with Probability Distribution over Word Set and Recurrence Time Theorem(Source Cording/Image Processing)(Information Theory and Its Applications)
- On performance of prediction using side information
- A Formulation by Minimization of Differential Entropy for Optimal Control System