Universal Burst Error Correction(HISC2006)

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, it is shown that under very mild assumptions, practically any binary linear block code of length N and dimension K is able to correct any burst of length up to N-K with probability of success P_c=1 for erasures, and any burst of length up to N-K-m with probability of success P_c⥸1-N2^<-m> for errors. In both cases, the decoding is based on identifying a string of zeroes in an extended syndrome corresponding to a particular representation of the parity check matrix of the code and its complexity is O(N^2) binary operations.

• 一般社団法人電子情報通信学会の論文
• 2006-05-18

著者

• Fossorier Marc

  Department Of Electrical Engineering University Of Hawaii

関連論文

• 不均一誤り訂正のための3レベルBCH符号化8-PSK変調について
• Birthday Paradox Based Security Analysis of Certain Broadcast Encryption Schemes(Information Security)
• A Novel Approach to Algebraic and Fast Correlation Attacks for Cryptanalysis of Certain Keystream Generators
• Doubly Generalized LDPC Codes(HISC2006)
• Iterative Biased Reliability-Based Decoding of Binary Linear Codes
• A Practical Approach for Coded OFDM with Partial Transmit Sequence(Mobile Multimedia Communications)
• Reduced Latency Iterative Decoding
• Universal Burst Error Correction(HISC2006)

スポンサーリンク