𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the equivalence of certain constant weight codes and combinatorial designs

✍ Scribed by Victor A. Zinoviev

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
266 KB
Volume
56
Category
Article
ISSN
0378-3758

No coin nor oath required. For personal study only.

✦ Synopsis

Stinson and van

Rees (Combinatorica (1984), 357-362)

proved that the existence of an equidistant code E: (n = 4s + 1,d = 2s, N) with N = n implies the existence of a certain symmetrical BIB design. This result is extended here for the constant weight codes with the same n and d. A theorem on the equivalence of a Hadamard matrix and a certain constant weight code is also proved.

πŸ“œ 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 number of code words wi
On computing the number of code words with minimum weight for cyclic codes
✍ Masami Mohri; Masakatsu Morii πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 264 KB πŸ‘ 2 views

The weight distribution is an important parameter that determines the performance of a code. The minimum distance and the number of corresponding codes that can be derived from the weight distribution, greatly affect the performance of the code. The decoding error probability and other performance m