On the number of C∞-words of each length
✍ Scribed by William D Weakley
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 448 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In 1991 Dixon and Kovacs 8 showed that for each field K which has finite degree over its prime subfield there is a number d such that every K finite nilpotent irreducible linear group of degree n G 2 over K can be w x wx ' generated by d nr log n elements. Afterwards Bryant et al. 3 proved K ' d G F
The weight distribution is an important parameter that determines the performance of a code. The minimum distance and the number of corresponding codes that can be derived from the weight distribution, greatly affect the performance of the code. The decoding error probability and other performance m