2011
DOI: 10.1109/tit.2011.2146010
|View full text |Cite
|
Sign up to set email alerts
|

Sequence Folding, Lattice Tiling, and Multidimensional Coding

Abstract: Folding a sequence S into a multidimensional box is a well-known method which is used as a multidimensional coding technique. The operation of folding is generalized in a way that the sequence S can be folded into various shapes and not just a box. The new definition of folding is based on a lattice tiling for the given shape S and a direction in the Ddimensional integer grid. Necessary and sufficient conditions that a lattice tiling for S combined with a direction define a folding of a sequence into S are der… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
2
2
2

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(15 citation statements)
references
References 60 publications
0
15
0
Order By: Relevance
“…In fact it should be said that is very likely that most if not all Costas arrays are known since they derived from the known constructions [25]. In what follows we will throw more evidence for the difficulty to produce new doubly periodic S-DDCs with many dots, different from those constructed by folding [4].…”
Section: The Periodic Golomb Constructionmentioning
confidence: 97%
See 3 more Smart Citations
“…In fact it should be said that is very likely that most if not all Costas arrays are known since they derived from the known constructions [25]. In what follows we will throw more evidence for the difficulty to produce new doubly periodic S-DDCs with many dots, different from those constructed by folding [4].…”
Section: The Periodic Golomb Constructionmentioning
confidence: 97%
“…Given a tiling (T , S) and a grid point (i 1 , i 2 ) we denote by c(i 1 , i 2 ) the center of the copy of S, S ′ , for which (i 1 , i 2 ) ∈ S ′ . We will also assume that the origin is a center of a copy of S. The first lemma given in [4] can be easily verified.…”
Section: B Tilingmentioning
confidence: 99%
See 2 more Smart Citations
“…10,[13][14][15][16] The construction of 2D toroidal PSMs not based on De Bruin sequences is more difficult. Several approaches have been suggested using evolutionary algorithms 14,17 or brute force exhaustive search.…”
mentioning
confidence: 99%