Folding, Tiling, and Multidimensional Coding
Tuvi Etzion

TL;DR
This paper introduces a generalized folding method based on lattice tiling and directions in multidimensional grids, enabling new code constructions and bounds for synchronization patterns and error correction.
Contribution
It generalizes the folding operation to various shapes using lattice tiling and directions, providing new theoretical bounds and applications in multidimensional coding.
Findings
New lower bounds on dots in 2D synchronization patterns
Generalized folding operation for various shapes
Applications in multidimensional error-correcting codes
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Cellular Automata and Applications · DNA and Biological Computing
