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

On the Complete Weight Enumerator of Reed-Solomon Codes

โœ Scribed by Blake, Ian F.; Kith, Khun

Book ID
118198453
Publisher
Society for Industrial and Applied Mathematics
Year
1991
Tongue
English
Weight
727 KB
Volume
4
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the weight enumerator of product code
On the weight enumerator of product codes
โœ L.M.G.M. Tolhuizen; C.P.M.J. Baggen ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 381 KB

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

The complete weight enumerator for codes
The complete weight enumerator for codes over Mnร—s(R)
โœ I. Siap; M. Ozen ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 287 KB

MacWilliams identity for complete weight enumerators of codes over Mnxs(Fq) endowed with a non-Hamming metric is proved in [l]. We extend the notions introduced in [l] and prove a MacWilliams identity with respect to this new metric for the complete weight enumerator of linear codes over Mnxs(R) whe