Reliability Functions for Concatenated Codes Employing Modular Codes with Maximum Likelihood Decoding
スポンサーリンク
概要
- 論文の詳細を見る
This paper investigates the error correcting capabilities of concatenated codes employing algebraic geometry codes as outer codes and time-varying randomly selected inner codes, used on discrete memoryless channels with maximum likelihood decoding. It is proved that Gallager's random coding error exponent can be obtained for all rates by such codes. Further, it is clarified that the error exponent arbitrarily close to Gallager's can be obtained for almost all random selections of inner codes with a properly chosen code length, provided that the length of the outer code is sufficiently large. For a class of regular channels, the result is also valid for linear concatenated codes, and Gallager's expurgated error exponent can be asymptotically obtained for all rates.
- 社団法人電子情報通信学会の論文
- 1995-09-25
著者
-
Okamoto E
Toho Univ. Funabashi Jpn
-
OKAMOTO Eiji
School of Engineering, Hokkaido Tokai University
-
Uyematsu T
The Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Uyematsu T
The Author Is With The Department Of Electrical And Electronic Engineering Tokyo Institute Of Techno
-
Uematsu Tomohiko
School of Information Science, Japan Advanced Institute of Science and Technology
-
Kaga Junya
School of Information Science, Japan Advanced Institute of Science and Technology
-
Kaga Junya
School Of Information Science Japan Advanced Institute Of Science And Technology
関連論文
- Numerical estimation of heat distribution from the implantable battery system of an undulation pump LVAD
- Efficient Secret Sharing Schemes Based on Authorized Subsets(Cryptography and Information Security)
- Secret Key Capacity for Ergodic Correlated Sources(Information Theory)
- One-Point Algebraic Geometric Codes from Artin-Schreier Extensions of Hermitian Function Fields (Special Section on Information Theory and Its Applications)
- A Simple Parallel Algorithm for the Ziv-Lempel Encoding
- An Efficient Universal Coding Algorithm for Noiseless Channel with Symbols of Unequal Cost
- Proposal of an Automatic Signature Scheme Using a Compiler (Special Section on Cryptography and Information Security)
- Reliability Functions for Concatenated Codes Employing Modular Codes with Maximum Likelihood Decoding
- Permutation Cipher Scheme Using Polynomials over a Field
- A Secure Broadcast Communication Method with Short Messages (Special Section on Information Theory and Its Applications)
- Constructing Identity-Based Key Distribution Systems over Elliptic Curves (Special Section on Information Theory and Its Applications)
- Feasibility of a remote monitoring system for patients with an implantable left ventricular assist device using Personal Handy-Phone System telecommunication technology
- Proxy Cryptosystems: Delegation of the Power to Decrypt Ciphertexts (Special Section on Cryptography and Information Security)
- Factoring Hard Integers on a Parallel Machine (Special Section on Discrete Mathematics and Its Applications)
- Faster Factoring of Integers of a Special Form (Special Section on Discrete Mathematics and Its Applications)
- Algebraic Properties of Permutation Polynomials (Special Section on Discrete Mathematics and Its Applications)