𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Code pairs with specified parity of the Hamming distances

✍ Scribed by R. Ahlswede; Z. Zhang

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
378 KB
Volume
188
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Upper Bounds on the Covering Radius of a
Upper Bounds on the Covering Radius of a Code with a Given Dual Distance
✍ S. Litsyn; A. TietΓ€vΓ€inen πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 235 KB

We derive new upper bounds on the covering radius of a binary linear code as a function of its dual distance and dual-distance width . These bounds improve on the Delorme -Sole Β΄ -Stokes bounds , and in a certain interval for binary linear codes they are also better than Tieta Β¨ va Β¨ inen's bound .