On the optimality of coloring with a lattice

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 21-

  Merksamer, Yael ^a   Etzion, Tuvi ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR-CORRECTING CODES; GRID GRAPHS; SPANNING TREE;

CODES (SYMBOLS); COLORING; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; SET THEORY; THEOREM PROVING;

GRAPH THEORY;

EID: 5044250985     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. M. Blaum, J. Bruck, and A. Vardy, "Interleaving schemes for multidimensional cluster errors," IEEE Trans. Inform. Theory, vol. 44, pp. 730-743, Mar. 1998.
2. T. Etzion, M. Schwartz, and T. Vardy, "Optimal tristance anticodes in certain graphs," in preparation.
3. T. Etzion and A. Vardy, "Two-dimensional interleaving schemes with repetitions: constructions and bounds," IEEE Trans. Inform. Theory, vol. 48, pp. 428-457, Feb. 2002
4. S.W. Golomb and L.R. Welch, "Perfect codes in the Lee metric and the packing of polyominoes," SIAM J. Appl. Math., vol. 18, pp. 302-317, Jan. 1970.
5. M. Schwartz and T. Etzion, "Optimal 2-dimensional 3-dispersion lattices," Lecture notes in Computer Science, vol. 2643, pp. 216-225, 2003.