Weight properties of network codes
β Scribed by Yang, Shenghao ;Yeung, Raymond W. ;Zhang, Zhen
- Publisher
- John Wiley and Sons
- Year
- 2008
- Tongue
- English
- Weight
- 164 KB
- Volume
- 19
- Category
- Article
- ISSN
- 1124-318X
- DOI
- 10.1002/ett.1290
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In Langevin and Zanotti (1995), we introduced a new class of codes called balanced weight distribution (BWD)-codes, with the remarkable property that their weight distribution is balanced, i.e., there are the same number of codewords for each non-zero weight. The aim of this paper is to study the we
The Kasami codes is a family of [2 2m --1, 3m, 2 TM 1 \_ 2"-1 ] codes which are well known for their applications to construct sequences with optimal correlation magnitudes. The weight hierarchy of the Kasami codes is completely determined. It is also shown that the chain condition holds for these c
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