Abstract
Abstract In this talk, we will present results about perfect weighted coverings of radius 1 in the Lee metric. Weighted coverings are a very natural generalization of many classes of codes. Perfect weighted coverings are well studied in the Hamming metric, but also in other contexts with different names, such as regular-sets, multiple coverings or [ a , b ]-dominating sets. In this talk, we present results of existence as well as of non-existence for perfect weighted coverings of radius one on the multidimensional grid graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Paper Title
Journal
Date
