4 research outputs found
Folding, Tiling, and Multidimensional Coding
Folding a sequence into a multidimensional box is a method that is used
to construct multidimensional codes. The well known operation of folding is
generalized in a way that the sequence can be folded into various shapes.
The new definition of folding is based on lattice tiling and a direction in the
-dimensional grid. There are potentially different folding
operations. Necessary and sufficient conditions that a lattice combined with a
direction define a folding are given. The immediate and most impressive
application is some new lower bounds on the number of dots in two-dimensional
synchronization patterns. This can be also generalized for multidimensional
synchronization patterns. We show how folding can be used to construct
multidimensional error-correcting codes and to generate multidimensional
pseudo-random arrays
High Dimensional Error-Correcting Codes
Abstract—In this paper we construct multidimensional codes with high dimension. The codes can correct high dimensional errors which have the form of either small clusters, or confined to an area with a small radius. We also consider small number of errors in a small area. The clusters which are discussed are mainly spheres such as semi-crosses and crosses. Also considered are clusters with small number of errors such as 2-bursts, two errors in various clusters, and three errors on a line. Our main focus is on the redundancy of the codes when the most dominant parameter is the dimension of the code. I