Tilings of the plane and codes for translational combinatorial metrics

Vladimir Sidorenko

Research output: Contribution to conferencePaperpeer-review

5 Citations (Scopus)

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.

Original languageEnglish
Pages107
Number of pages1
DOIs
Publication statusPublished - 1994
Externally publishedYes
Event1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway
Duration: 27 Jun 19941 Jul 1994

Conference

Conference1994 IEEE International Symposium on Information Theory, ISIT 1994
Country/TerritoryNorway
CityTrondheim
Period27/06/941/07/94

Fingerprint

Dive into the research topics of 'Tilings of the plane and codes for translational combinatorial metrics'. Together they form a unique fingerprint.

Cite this