Skip to content

An upper bound for the minimum distance of Lee-codes over large alphabets and its application to the perfect code problem

by Jaakko Astola

Writing a summary for young readers…

For young readers

Book data: Open Library