201 citations · 365 across the 23 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
cs.IT2010
On Perfect Codes in the Johnson Graph
Natalia Silberstein, Tuvi Etzion
In this paper we consider the existence of nontrivial perfect codes in the Johnson graph J(n,w). We present combinatorial and number theory techniques to provide necessary conditio…
cs.IT2010★ 1 cited
Properties of Codes in the Johnson Scheme
Natalia Silberstein
Codes which attain the sphere packing bound are called perfect codes. The most important metrics in coding theory on which perfect codes are defined are the Hamming metric and the…
cs.IT2010
Large Constant Dimension Codes and Lexicodes
Natalia Silberstein, Tuvi Etzion
Constant dimension codes, with a prescribed minimum distance, have found recently an application in network coding. All the codewords in such a code are subspaces of $\F_q^n$ with…