Extending and analysis of X-Code
โ Scribed by Chao Jin; Dan Feng; Jing-ning Liu
- Book ID
- 107482875
- Publisher
- Chinese Electronic Periodical Services
- Year
- 2011
- Tongue
- English
- Weight
- 325 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1007-6417
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Symposium on Inform. Theory, Whistler, Canada,'' pp. 345) proved that every [n, k, d] O code with gcd(d, q)"1 and with all weights congruent to 0 or d (modulo q) is extendable to an O code with all weights congruent to 0 or d#1 (modulo q). We give another elementary geometrical proof of this theor
Classical Goppa codes are a special case of Alternant codes. First we prove that the parity-check subcodes of Goppa codes and the extended Goppa codes are both Alternant codes. Before this paper, all known cyclic Goppa codes were some particular BCH codes. Many families of Goppa codes with a cyclic
If N = 2 k 16 then there exist exactly b(k 1)=2c pairwise nonequivalent Z 4linear Hadamard (N 2N N = 2)-codes and b(k + 1 ) =2c pairwise nonequivalent Z 4linear extended perfect (N 2 N =2N 4)-codes. Recurrent construction of Z 4 -linear Hadamard codes is given.