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

Weight enumerators of more irreducible cyclic binary codes

โœ Scribed by Ward, R.L.

Book ID
114539813
Publisher
IEEE
Year
1993
Tongue
English
Weight
867 KB
Volume
39
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Local Weight Enumerators for Binary Self
Local Weight Enumerators for Binary Self-Dual Codes
โœ Udo Ott ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 139 KB

Moreover, if 0 admits the (t, i)-design property for every i t, we say that 0 admits the t-design property.

All Two-Weight Irreducible Cyclic Codes?
All Two-Weight Irreducible Cyclic Codes?
โœ Bernhard Schmidt; Clinton White ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 338 KB

The aim of this paper is the classi"cation of two-weight irreducible cyclic codes. Using Fourier transforms and Gauss sums, we obtain necessary and su$cient numerical conditions for an irreducible cyclic code to have at most two weights. This gives a uni"ed explanation for all two-weight irreducible

Weight Behavior of Irreducible Cyclic BW
Weight Behavior of Irreducible Cyclic BWD-Codes
โœ J.-P. Zanotti ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 280 KB

In Langevin and Zanotti (1995), we introduced a new class of codes called balanced weight distribution (BWD)-codes, with the remarkable property that their weight distribution is balanced, i.e., there are the same number of codewords for each non-zero weight. The aim of this paper is to study the we