On the weight distribution of convolutional codes
β Scribed by Heide Gluesing-Luerssen
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 359 KB
- Volume
- 408
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract In 1996 Rosenthal and York proposed (timeβinvariant) BCH convolutional codes [4] in which the parity check matrix of a BCH code is used in the construction of the convolutional code. The lower bound on the minimum free distance of a BCH convolutional code is guaranteed by the BCH limit.
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