“School of Mathematics”
Back to Papers HomeBack to Papers of School of Mathematics
Paper IPM / M / 8787  


Abstract:  
A paritycheck matrix H of a given code C is called
minimal if it has minimum number of nonzero entries among all
paritycheck matrices representing C. Let
C_{1} and C_{2} be two binary linear block
codes with minimal paritycheck matrices H_{1} and H_{2},
respectively. It is shown that, using H_{1} and H_{2}, one can
efficiently generate a minimal paritycheck matrix for the product
code C_{1} ⊗ C_{2}.
Download TeX format 

back to top 