Optimal 2-dimensional 3-dispersion lattices

Moshe Schwartz; Tuvi Etzion

doi:10.1007/3-540-44828-4_23

Optimal 2-dimensional 3-dispersion lattices

Moshe Schwartz, Tuvi Etzion

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

8 Scopus citations

Abstract

We examine 2-dimensional 3-dispersion lattice interleaves in three connectivity models: the rectangular grid with either 4 or 8 neighbors, and the hexagonal grid. We provide tight lower bounds on the interleaving degree in all cases and show lattices which achieve the bounds.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Marc Fossorier, Tom Hoholdt, Alain Poli
Publisher	Springer Verlag
Pages	216-225
Number of pages	10
ISBN (Print)	3540401113
DOIs	https://doi.org/10.1007/3-540-44828-4_23
State	Published - 1 Jan 2003
Externally published	Yes

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2643
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-44828-4_23

Cite this

Schwartz, M., & Etzion, T. (2003). Optimal 2-dimensional 3-dispersion lattices. In M. Fossorier, T. Hoholdt, & A. Poli (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 216-225). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2643). Springer Verlag. https://doi.org/10.1007/3-540-44828-4_23

Schwartz, Moshe ; Etzion, Tuvi. / Optimal 2-dimensional 3-dispersion lattices. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Marc Fossorier ; Tom Hoholdt ; Alain Poli. Springer Verlag, 2003. pp. 216-225 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{3821515865e54d3aba514830f4ea80eb,

title = "Optimal 2-dimensional 3-dispersion lattices",

abstract = "We examine 2-dimensional 3-dispersion lattice interleaves in three connectivity models: the rectangular grid with either 4 or 8 neighbors, and the hexagonal grid. We provide tight lower bounds on the interleaving degree in all cases and show lattices which achieve the bounds.",

author = "Moshe Schwartz and Tuvi Etzion",

year = "2003",

month = jan,

day = "1",

doi = "10.1007/3-540-44828-4_23",

language = "English",

isbn = "3540401113",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "216--225",

editor = "Marc Fossorier and Tom Hoholdt and Alain Poli",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "Germany",

}

Schwartz, M & Etzion, T 2003, Optimal 2-dimensional 3-dispersion lattices. in M Fossorier, T Hoholdt & A Poli (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2643, Springer Verlag, pp. 216-225. https://doi.org/10.1007/3-540-44828-4_23

Optimal 2-dimensional 3-dispersion lattices. / Schwartz, Moshe; Etzion, Tuvi.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Marc Fossorier; Tom Hoholdt; Alain Poli. Springer Verlag, 2003. p. 216-225 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2643).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Optimal 2-dimensional 3-dispersion lattices

AU - Schwartz, Moshe

AU - Etzion, Tuvi

PY - 2003/1/1

Y1 - 2003/1/1

N2 - We examine 2-dimensional 3-dispersion lattice interleaves in three connectivity models: the rectangular grid with either 4 or 8 neighbors, and the hexagonal grid. We provide tight lower bounds on the interleaving degree in all cases and show lattices which achieve the bounds.

AB - We examine 2-dimensional 3-dispersion lattice interleaves in three connectivity models: the rectangular grid with either 4 or 8 neighbors, and the hexagonal grid. We provide tight lower bounds on the interleaving degree in all cases and show lattices which achieve the bounds.

UR - http://www.scopus.com/inward/record.url?scp=21144438992&partnerID=8YFLogxK

U2 - 10.1007/3-540-44828-4_23

DO - 10.1007/3-540-44828-4_23

M3 - Chapter

AN - SCOPUS:21144438992

SN - 3540401113

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 216

EP - 225

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Fossorier, Marc

A2 - Hoholdt, Tom

A2 - Poli, Alain

PB - Springer Verlag

ER -

Schwartz M, Etzion T. Optimal 2-dimensional 3-dispersion lattices. In Fossorier M, Hoholdt T, Poli A, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2003. p. 216-225. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44828-4_23

Optimal 2-dimensional 3-dispersion lattices

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this