Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Error-correcting codes and Minkowski's conjecture

In: Tatra Mountains Mathematical Publications, vol. 45, no. 1
Peter Horák

Details:

Year, pages: 2010, 37 - 49
Keywords:
Lee codes, tilings, unit cubes.
About article:
The goal of this paper is twofold. The main one is to survey the latest results on the perfect and quasi-perfect Lee error correcting codes. The other goal is to show that the area of Lee error correcting codes, like many ideas in mathematics, can trace its roots to the Phytagorean theorem $a2+b2=c2$. Thus to show that the area of the perfect Lee error correcting codes is an integral part of mathematics. It turns out that Minkowski's conjecture, which is an interface of number theory, approximation theory, geometry, linear algebra, and group theory is one of the milestones on the route to Lee codes.
How to cite:
ISO 690:
Horák, P. 2010. Error-correcting codes and Minkowski's conjecture. In Tatra Mountains Mathematical Publications, vol. 45, no.1, pp. 37-49. 1210-3195.

APA:
Horák, P. (2010). Error-correcting codes and Minkowski's conjecture. Tatra Mountains Mathematical Publications, 45(1), 37-49. 1210-3195.