Optimal tristance anticodes in certain graphs

DOI10.1016/j.jcta.2005.01.012zbMath1082.05030DBLPjournals/jct/EtzionSV06arXivmath/0406246OpenAlexW2137334964WikidataQ59903146 ScholiaQ59903146MaRDI QIDQ817597

Moshe Schwartz, Tuvi Etzion, Alexander Vardy

Publication date: 16 March 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0406246

zbMATH Keywords

grid graph\(L_{1}\)-distancemultidimensional interleaving

Mathematics Subject Classification ID

Distance in graphs (05C12) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40)

Related Items (2)

Erdös--Falconer Distance Problem under Hamming Metric in Vector Spaces over Finite Fields ⋮ Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect codes over graphs
• The diametric theorem in Hamming spaces---optimal anticodes
• Codes and anticodes in the Grassman graph
• Anticodes for the Grassmann and bilinear forms graphs
• The complete nontrivial-intersection theorem for systems of finite sets
• Perfect codes in graphs
• Codes in Bipartite Distance-Regular Graphs
• Interleaving schemes for multidimensional cluster errors
• Optimal 2-Dimensional 3-Dispersion Lattices
• Two-dimensional interleaving schemes with repetitions: constructions and bounds
• On the Optimality of Coloring with a Lattice
• Tiling with polyominoes

This page was built for publication: Optimal tristance anticodes in certain graphs