“School of Mathematics”
Back to Papers HomeBack to Papers of School of Mathematics
| Paper IPM / M / 8787 |
|
| Abstract: | |
|
A parity-check matrix H of a given code C is called
minimal if it has minimum number of nonzero entries among all
parity-check matrices representing C. Let
C1 and C2 be two binary linear block
codes with minimal parity-check matrices H1 and H2,
respectively. It is shown that, using H1 and H2, one can
efficiently generate a minimal parity-check matrix for the product
code C1 ⊗ C2.
Download TeX format |
|
| back to top | |
