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

1. Olof Heden, “On the size of the symmetry group of a perfect code”, Discrete Mathematics, 311, no. 17, 2011, 1879  
2. Алексей Дмитриевич Коршунов, Aleksei Dmitrievich Korshunov, “Некоторые нерешенные задачи дискретной математики и математической кибернетики”, УМН, 64, no. 5, 2009, 3  
3. I.Yu. Mogilnykh, F.I. Solov’eva, “On existence of perfect bitrades in Hamming graphs”, Discrete Mathematics, 343, no. 12, 2020, 112128  
4. P. Ostergard, O. Pottonen, “The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification”, IEEE Trans. Inform. Theory, 55, no. 10, 2009, 4657  
5. Sergey V. Avgustinovich, Denis S. Krotov, “Embedding in a perfect code”, J of Combinatorial Designs, 17, no. 5, 2009, 419  
6. RENAN GROSS, URI GRUPEL, “Indistinguishable Sceneries on the Boolean Hypercube”, Combinator. Probab. Comp., 28, no. 1, 2019, 46  
7. F. I. Solov’eva, “Partitions into Perfect Codes in the Hamming and Lee Metrics”, Probl Inf Transm, 58, no. 3, 2022, 254  
8. V. K. Leont’ev, G. L. Movsisyan, J. G. Margaryan, “On perfect codes for an additive channel”, Probl Inf Transm, 44, no. 4, 2008, 295  
9. Olof Heden, “Perfect Codes of Length n with Kernels of Dimension $n-\log(n+1)-3$”, SIAM J. Discrete Math., 22, no. 4, 2008, 1338