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 SettingsAstola, J. (1980). An upper bound for the minimum distance of Lee-codes over large alphabets and its application to the perfect code problem. [Lappeenrannan teknillinen korkeakoulu].
Chicago Style CitationAstola, Jaakko. An Upper Bound for the Minimum Distance of Lee-codes over Large Alphabets and Its Application to the Perfect Code Problem. [Lappeenranta]: [Lappeenrannan teknillinen korkeakoulu], 1980.
MLA CitationAstola, Jaakko. An Upper Bound for the Minimum Distance of Lee-codes over Large Alphabets and Its Application to the Perfect Code Problem. [Lappeenrannan teknillinen korkeakoulu], 1980.
Harvard Style CitationAstola, J. 1980. An upper bound for the minimum distance of Lee-codes over large alphabets and its application to the perfect code problem. [Lappeenranta]: [Lappeenrannan teknillinen korkeakoulu].
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