27 citations · 76 across the 10 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
cs.DM2012★ 1 cited
A Generalization of Lee Codes
Carlos Araujo, Italo J. Dejter, Peter Horak
Motivated by a problem in computer architecture we introduce a notion of the perfect distance-dominating set, PDDS, in a graph. PDDSs constitute a generalization of perfect Lee cod…
cs.IT2012
Tiling by Crosses
Peter Horak, Viliam Hromada
An -dimensional cross comprises unit cubes: the center cube and reflections in all its faces. It is well known that there is a tiling of by crosses for all A…
cs.IT2012★ 27 cited
A New Approach Towards the Golomb-Welch Conjecture
Peter Horak, Otokar Grosek
The Golomb-Welch conjecture deals with the existence of perfect % -error correcting Lee codes of word length codes. Although there are many papers on the topic, t…