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

On the minimum average distance of binary constant weight codes

โœ Scribed by Shu-Tao Xia; Fang-Wei Fu; Yong Jiang

Book ID
108113869
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
172 KB
Volume
308
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the maximum cardinality of binary con
On the maximum cardinality of binary constant weight codes with prescribed distance
โœ Cornelis de Vroedt ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 293 KB

De Vroedt, C., On the maximum cardinality of binary constant weight codes with prescribed distance, Discrete Mathematics 97 (1991) 155-160. Let A(n, d, w) be the maximum cardinality of a binary code with length n, constant weight w (0 G w < [n/2]) and Hamming distance d. In this paper a method is di

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

On the Minimum Average Distance Spanning
On the Minimum Average Distance Spanning Tree of
โœ Maurice Tchuente; Paulin Melatagia Yonta; Jean-Michel Nlong; Yves Denneulin ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 492 KB