Distance-2 MDS codes and Latin colorings in the Doob graphs

DOI10.1007/s00373-018-1926-4zbMath1402.05167arXiv1510.01429OpenAlexW2269337634MaRDI QIDQ1756044

Denis S. Krotov, Evgeniĭ Andreevich Bespalov

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

maximum cutmaximum independent setDoob graphequitable partitionLatin hypercubeMDS codecompletely regular set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Orthogonal arrays, Latin squares, Room squares (05B15) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On decomposability of 4-ary distance 2 MDS codes, double-codes, and \(n\)-quasigroups of order 4
• On \(r\)-partition designs in Hamming spaces
• MDS codes in Doob graphs
• A bound on correlation immunity
• Perfect colorings of the 12-cube that attain the bound on correlation immunity
• On reducibility of \(n\)-ary quasigroups
• On the number of maximum independent sets in Doob graphs
• On extensions of partial n-quasigroups of order 4
• n-Ary Quasigroups of Order 4

This page was built for publication: Distance-2 MDS codes and Latin colorings in the Doob graphs