TY - GEN
T1 - Tilings of the plane and codes for translational combinatorial metrics
AU - Sidorenko, Vladimir
PY - 1994
Y1 - 1994
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84894339134&partnerID=8YFLogxK
U2 - 10.1109/ISIT.1994.394881
DO - 10.1109/ISIT.1994.394881
M3 - Conference contribution
AN - SCOPUS:84894339134
SN - 0780320158
SN - 9780780320154
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 107
BT - Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Y2 - 27 June 1994 through 1 July 1994
ER -