Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
Crossref DOI link: https://doi.org/10.1134/S1990478915010159
Published Online: 2015-02-28
Published Print: 2015-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Vorob’ev, K. V.
Krotov, D. S.
Text and Data Mining valid from 2015-01-01