Opening book details…
About this Computer Science article
Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph by Vorob’ev, K. V.; Krotov, D. S. is a Computer Science article available to read on EtoBox.
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Vorob’ev, K. V.; Krotov, D. S.
- Publisher
- Pleiades Publishing; Pleiades Publishing Ltd (ISSN 1990-4789)
- Published
- 2015
- Language
- EN
- Field
- Computer Science (Physical Sciences)