Open Problems in the Lee Metric

Although the Lee metric is one of the oldest metrics in coding theory, being already introduced in 1958, it has not enjoyed much attention and many questions remain open until today. 

Most of the known Lee-metric bounds stem from simple adaptions of classical techniques and do not reflect well the particular behavior of the new setting. 

In this talk I give an overview of known coding-theoretic properties before delving into some of the main open problems, including a tight Singleton-like bound, the Golomb-Welch conjecture and code constructions.