Sergey Goryainov, Denis Krotov. Completely regular codes in graphs covered by a Hamming graph. // Designs, Codes and Cryptography. – 2026. – DOI: 10.1007/s10623-026-01955-2. – URL: https://doi.org/10.1007/s10623-026-01955-2
Sergey Goryainov & Denis Krotov (2026). Completely regular codes in graphs covered by a Hamming graph. Designs, Codes and Cryptography. https://doi.org/10.1007/s10623-026-01955-2
Sergey Goryainov and Denis Krotov. “Completely regular codes in graphs covered by a Hamming graph.” Designs, Codes and Cryptography, 2026. doi:10.1007/s10623-026-01955-2.
@article{Goryainov2026,
title = {Completely regular codes in graphs covered by a Hamming graph},
author = {Goryainov, Sergey and Krotov, Denis},
journal = {Designs, Codes and Cryptography},
year = {2026},
doi = {10.1007/s10623-026-01955-2},
url = {https://doi.org/10.1007/s10623-026-01955-2}
}