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

A note on the existence of perfect constant weight codes

โœ Scribed by C. Roos

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
174 KB
Volume
47
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the non-existence of certain perfect
On the non-existence of certain perfect mixed codes
โœ G.J.M.van Wee ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 229 KB

It is shown that if a nontrivial perfect mixed e-code in Q, x Q2 x . . . x Q, exists, where the Qi are alphabets of size qi, then the qt, e and n satisfy certain divisibility conditions.

On the Non - Existence of Perfect Codes
On the Non - Existence of Perfect Codes with Rank Distance
โœ Kefei Chen ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 347 KB

Theory of codes with rank distance was introduced in 1985, which can be applied to crisscross error correction and also used to build some cryptographical schemes. We know that the existence of perfect codes is an interesting topic in coding theory; as a new type of codes, we consider the existence

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