On extended 1-perfect bitrades

MaRDI QIDQ6355261FDO

Authors Evgeniĭ Andreevich Bespalov, Denis S. Krotov

Publication date 3 December 2020

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial codes (94B25)

Abstract: We prove the equivalence of several definitions of extended $1$-perfect bitrades in the Hamming graph $H(n,q)$ and prove the nonexistence of such bitrades for odd $n$.

This page was built for publication: On extended 1-perfect bitrades

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6355261)