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.
|Number of pages||1|
|Publication status||Published - 1994|
|Event||1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway|
Duration: 27 Jun 1994 → 1 Jul 1994
|Conference||1994 IEEE International Symposium on Information Theory, ISIT 1994|
|Period||27/06/94 → 1/07/94|