On the Stopping Distance and Stopping Redundancy of Product Codes

スポンサーリンク

概要

• 論文の詳細を見る

• Stopping distance and stopping redundancy of product binary linear block codes is studied. The relationship between stopping sets in a few parity-check matrices of a given product code C and those in the parity-check matrices for the component codes is determined. It is shown that the stopping distance of a particular parity-check matrix of C, denoted Hp, is equal to the product of the stopping distances of the associated constituent parity-check matrices. Upper bounds on the stopping redundancy of C is derived. For each minimum distance d=2r, r≥1, a sequence of [n, k, d] optimal stopping redundancy binary codes is given such k/n tends to 1 as n tends to infinity.

• （社）電子情報通信学会の論文
• 2008-08-01

著者

• Esmaeili Morteza

  Isfahan Univ. Of Technol. Isfahan Irn

• Esmaeili Morteza

  Dept. Of Mathematical Sciences Isfahan Univ. Of Technology

• HIVADI Morteza

  Dept. of Mathematical Sciences, Isfahan University of Technology

• Hivadi Morteza

  Dept. Of Mathematical Sciences Isfahan University Of Technology

関連論文

• Some Constacyclic and Cyclic Codes Over F_q[u]/
• On the Stopping Distance and Stopping Redundancy of Product Codes

スポンサーリンク