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

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

datePublished

• 1980

description

• kuvitettu

identifier

• propertyID: FI-FENNI value: 105324
• propertyID: FI-MELINDA value: 000651821
• propertyID: skl value: fx105324

isbn

• 9517631308

isPartOf

• Fennica
• Katsauksia = Översikter = Reviews

name

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

numberOfPages

• [1], 8, [2] lehteä

P60048

• <http://rdaregistry.info/termList/RDACarrierType/1049>

P60050

• <http://rdaregistry.info/termList/RDAMediaType/1007>

publication

• location: Lappeenranta organizer: Lappeenrannan teknillinen korkeakoulu

publisher

• Lappeenrannan teknillinen korkeakoulu