An upper bound for the minimum distance of Lee-codes over large alphabets and its application to the perfect code problemby Jaakko AstolaWriting a summary for young readers…For young readersBook data: Open Library