Perfect codes in the discrete simplex

We study the problem of existence of (nontrivial) perfect codes in the discrete n -simplex Δ ℓ n : = x 0 , … , x n : x i ∈ Z + , ∑ i x i = ℓ under ℓ 1 metric. The problem is motivated by the so-called multiset codes, which have recently been introduced by the authors as appropriate constructs for er...

Ausführliche Beschreibung