Error-correcting codes and Minkowski's conjecture

DOI10.2478/V10127-010-0004-YMaRDI QIDQ3161431zbMATH OpenOpenAlexWikidataFDO

Authors Peter Horák

Publication date 14 October 2010

Published in Tatra Mountains Mathematical Publications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2478/v10127-010-0004-y

zbMATH Keywords

lattice tilingsLee codesLee metricMinkowski's conjectureperfect error-correcting codesquasi-perfect error-correcting codesunit cubes

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• On perfect Lee codes
• A new approach towards the Golomb-Welch conjecture
• Tilings in Lee metric
• On some perfect codes with respect to Lee metric
• scientific article; zbMATH DE number 4031575

Cited in

(6)

• Error-correcting codes from \(k\)-resolving sets
• Nonexistence of perfect 2-error-correcting Lee codes in certain dimensions
• scientific article; zbMATH DE number 2185528 (Why is no real title available?)
• scientific article; zbMATH DE number 5953455 (Why is no real title available?)
• scientific article; zbMATH DE number 2116354 (Why is no real title available?)
• Massey’s Theorem and the Golay Codes

This page was built for publication: Error-correcting codes and Minkowski's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3161431)