zzungboy
Newbie level 3
There are two linear block code C1 and C2.
C1 is (n1, k1, d1) where d1 is min. distance. C2 is (n2, k2, d2).
The min. distance for product code C1C2 is d1d2.
And, the min. distance for incomplete product code C1C2 is d1+d2-1.
Can you prove these?
If you know any materials or book about proof of these, please let me know.
C1 is (n1, k1, d1) where d1 is min. distance. C2 is (n2, k2, d2).
The min. distance for product code C1C2 is d1d2.
And, the min. distance for incomplete product code C1C2 is d1+d2-1.
Can you prove these?
If you know any materials or book about proof of these, please let me know.