MDS codes in Doob graphs

DOI10.1134/S003294601702003XzbMath1437.94094arXiv1512.03361OpenAlexW2191679225MaRDI QIDQ2285072

Denis S. Krotov, Evgeniĭ Andreevich Bespalov

Publication date: 16 January 2020

Published in: Problems of Information Transmission (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15) Combinatorial codes (94B25)

Related Items (3)

On the minimum supports of some eigenfunctions in the Doob graphs ⋮ An extended Jebelean^ WeberNSedjelmaci GCD algorithm ⋮ Distance-2 MDS codes and Latin colorings in the Doob graphs

Cites Work

• Unnamed Item
• Perfect codes in Doob graphs
• Further results on the classification of MDS codes
• On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
• On sets of vectors of a finite vector space in which every subset of basis size is a basis
• (6,3)-MDS codes over an alphabet of size 4
• On the Classification of MDS Codes
• n-Ary Quasigroups of Order 4
• Classification of Graeco-Latin Cubes

This page was built for publication: MDS codes in Doob graphs