On the weight enumerator of product code
✍
L.M.G.M. Tolhuizen; C.P.M.J. Baggen
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 381 KB
The number of words of weight w in the product code of linear codes with minimum distances d, and d, is expressed in the number of low weight words of the constituent codes, provided that w <d,d, + max(d,, d<). By examples it is shown that, in general, the full weight enumerator of a product code is