𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Onr-partition designs in hamming spaces

✍ Scribed by Paul Camion; Bernard Courteau; Philippe Delsarte

Book ID
105147673
Publisher
Springer
Year
1992
Tongue
English
Weight
937 KB
Volume
2
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Coloring Problem in Hamming Spaces
A Coloring Problem in Hamming Spaces
✍ Patric R.J. Γ–stergΓ₯rd πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 219 KB

The R -domatic number of a graph is the maximum number of colors that can be used to color the vertices of the graph so that all vertices of the graph have at least one vertex of each color within distance R . In this paper the problem of determining the R -domatic number of the n -cube , P ( n , R

On Identifying Codes in Binary Hamming S
On Identifying Codes in Binary Hamming Spaces
✍ Iiro Honkala; Antoine Lobstein πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 138 KB

A binary code C f0; 1g n is called r-identifying, if the sets B r ðxÞ \ C; where B r ðxÞ is the set of all vectors within the Hamming distance r from x; are all nonempty and no two are the same. Denote by M r ðnÞ the minimum possible cardinality of a binary r-identifying code in f0; 1g n : We prove

On partitions of the q-ary Hamming space
On partitions of the q-ary Hamming space into few spheres
✍ Andreas Klein; Markus Wessler πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 165 KB

## Abstract In this paper, we present a generalization of a result due to Hollmann, KΓΆrner, and Litsyn [9]. They prove that each partition of the __n__‐dimensional binary Hamming space into spheres consists of either one or two or at least __n__ + 2 spheres. We prove a __q__‐ary version of that gap