@inproceedings{ae05bd006a504c6aa26250a53f706510,
title = "Tilings of the plane and codes for translational combinatorial metrics",
abstract = "A combinatorial metric generalizes the majority of metrics which have been considered in coding theory. Let code words be q-ary n ×n-matrices and a translational combinatorial metric be defined by a template T. We assume that one error can corrupt a code word's elements inside any translation of the template T. If the template T tiles the plane then the code with a certain distance d in the combinatorial metric can be constructed by special interleaving of codes with the same distance d in Hamming metric. Some optimal codes can be obtained using the construction.",
author = "Vladimir Sidorenko",
year = "1994",
doi = "10.1109/ISIT.1994.394881",
language = "English",
isbn = "0780320158",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "107",
booktitle = "Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994",
note = "1994 IEEE International Symposium on Information Theory, ISIT 1994 ; Conference date: 27-06-1994 Through 01-07-1994",
}