Search

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

QR Code
Finna rating

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

Saved in:
Kysy apua / Ask for help

Content Cannot be Displayed

Chat content cannot be displayed due to cookie settings. To view the content, modify your cookie settings to allow the following categories: Chat Services.

Cookie Settings