Optimal tristance anticodes in certain graphs
From MaRDI portal
Publication:817597
DOI10.1016/j.jcta.2005.01.012zbMath1082.05030arXivmath/0406246WikidataQ59903146 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
05C12: Distance in graphs
94B25: Combinatorial codes
05B40: Combinatorial aspects of packing and covering
Related Items
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