A Mixed Upper Bound on the Maximum Size of Codes for Multiple Burst Error Correction and Detection (Special Section on Information Theory and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• We derive an upper bound on the size of a block code with prescribed burst-error-correcting capability combining those two ideas underlying the generalized Singleton and sphere-packing bounds. The two ideas are puncturing and sphere-packing. We use the burst metric defined by Gabidulin [1], which is suitable for burst error correction and detection. It is demonstrated that the proposed bound improves previously known ones for finite code-length, when minimum distance is greater than 3, as well as in the asymptotic forms.

• 一般社団法人電子情報通信学会の論文
• 1998-10-25

著者

• Hamada M

  Japan Sci. And Technol. Corp. Tokyo Jpn

• Hamada Mitsuru

  Graduate School Of Information Systems The University Of Electro-communications

関連論文

• Almost Sure Convergence of Relative Frequency of Occurrence of Burst Errors on Channels with Memory (Special Section on Information Theory and Its Applications)
• A Mixed Upper Bound on the Maximum Size of Codes for Multiple Burst Error Correction and Detection (Special Section on Information Theory and Its Applications)

スポンサーリンク