9 citations to 10.1109/TIT.2011.2147758 (Crossref Cited-By Service)

1. Patric R. J. Ostergard, “On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16”, IEEE Trans. Inform. Theory, 57, no. 10, 2011, 6824  
2. Minjia Shi, Rongsheng Wu, Denis S. Krotov, “On q-Ary Shortened-1-Perfect-Like Codes”, IEEE Trans. Inform. Theory, 68, no. 11, 2022, 7100  
3. Denis S. Krotov, “On the OA(1536,13,2,7) and related orthogonal arrays”, Discrete Mathematics, 343, no. 2, 2020, 111659  
4. Denis S. Krotov, Vladimir N. Potapov, “On Multifold Packings of Radius-1 Balls in Hamming Graphs”, IEEE Trans. Inform. Theory, 67, no. 6, 2021, 3585  
5. Jong Yoon Hyun, “Harmonic Distributions for Equitable Partitions of a Hypercube”, J of Combinatorial Designs, 23, no. 7, 2015, 289  
6. Patric R. J. Östergård, “The sextuply shortened binary Golay code is optimal”, Des. Codes Cryptogr., 87, no. 2-3, 2019, 341  
7. Denis S. Krotov, “On the binary codes with parameters of triply-shortened 1-perfect codes”, Des. Codes Cryptogr., 64, no. 3, 2012, 275  
8. Janne I. Kokkala, Patric R. J. Östergård, “Classification of Graeco-Latin Cubes”, J. Combin. Designs, 23, no. 12, 2015, 509  
9. Sascha Kurz, “Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes”, Des. Codes Cryptogr., 2024