The weight distribution is an indispensable parameter in the performance evaluation of a code because of its importance in the analysis of the codes characteristics. Since the amount of computation needed to determine the overall weight distribution of a code usually depends on the number of data po
On minimum Hellinger distance estimation
โ Scribed by Jingjing Wu; Rohana J. Karunamuni
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- French
- Weight
- 400 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0319-5724
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract A difficult problem for turbo codes is the efficient and accurate determination of the distance spectrum, or even just the minimum distance, for specific interleavers. This is especially true for large blocks, with many thousands of data bits, if the distance is high. This paper compare
This paper derives the upper and lower bounds on the minimum distance of 4-ary circular trellis-coded modulation using a simplex signal constellation. The bounds are shown to be tight and reachable, and the code is shown to achieve simplex distance between parallel paths at each stage of the trellis
The extended Gini coefficient, C, is a measure of dispersion with strong theoretical merit for use in futures hedging. Yitzhaki (1982Yitzhaki ( , 1983) ) provides conditions under which a two-parameter framework using the mean and C of portfolio returns yields an efficient set consistent with second