Efficient Maximum Likelihood Decoding Algorithms for Linear Codes over Z-Channel (Special Section on Information Theory and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• This paper presents two new maximum likelihood decoding (MLD) algorithms for linear codes over Z-channel, which are much more efficient than conventional exhaustive algorithms for high rate codes. In the proposed algorithms, their complexities are reduced by employing the projecting set C_s of the code, which is determined by the "projecting" structure of the code. Space and computational complexities of algorithms mainly depend upon the size of C_s which is usually several times smaller than the total number of code-words. It is shown that the upper bounds on computational complexities of decoding algorithms are in proportion to the number of parity bits and the distance between an initial estimate of the codeword and the received word, respectively, while space complexities of them are equal to the size of C_s. Lastly, numerical examples clarify the average computational complexities of the proposed algorithms, and the efficiency of these algorithms for high rate codes is confirmed.

• 社団法人電子情報通信学会の論文
• 1993-09-25

著者

• Uyematsu Tomohiko

  The School Of Information Science Japan Advanced Institute Of Science And Technology

関連論文

• Efficient Maximum Likelihood Decoding Algorithms for Linear Codes over Z-Channel (Special Section on Information Theory and Its Applications)
• A Simple Construction of Codes for Identification via Channels under Average Error Criterion (Special Section on Information Theory and Its Applications)

スポンサーリンク