๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The minimum distance of parameterized codes on projective tori

โœ Scribed by Eliseo Sarmiento; Maria Vaz Pinto; Rafael H. Villarreal

Publisher
Springer
Year
2011
Tongue
English
Weight
224 KB
Volume
22
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On computing the minimum distance of lin
On computing the minimum distance of linear codes
โœ Masami Mohri; Masakatu Morii ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 245 KB ๐Ÿ‘ 2 views

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

Bounds on the Minimum Distance of High D
Bounds on the Minimum Distance of High Dimensional Circular Trellis-Coded Modulation
โœ Xiangyu Song; Jeffrey Dill; Alan R. Lindsey ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 132 KB

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