8 citations to 10.1002/jcd.20207 (Crossref Cited-By Service)

1. Patric R. J. Östergård, Olli Pottonen, “Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes”, Des. Codes Cryptogr., 59, no. 1-3, 2011, 281  
2. Patric R. J. Ostergard, Olli Pottonen, Kevin T. Phelps, “The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties”, IEEE Trans. Inform. Theory, 56, no. 6, 2010, 2571  
3. Denis S. Krotov, Ev V. Sotnikova, “Embedding in q-ary 1-perfect codes and partitions”, Discrete Mathematics, 338, no. 11, 2015, 1856  
4. Denis S. Krotov, “The extended 1-perfect trades in small hypercubes”, Discrete Mathematics, 340, no. 10, 2017, 2559  
5. A. M. Romanov, “On the admissible families of components of hamming codes”, J. Appl. Ind. Math., 6, no. 3, 2012, 355  
6. A. M. Romanov, “On full-rank perfect codes over finite fields”, J. Appl. Ind. Math., 10, no. 3, 2016, 444  
7. A. M. Romanov, “On the embedding of constant-weight codes into perfect codes”, J. Appl. Ind. Math., 10, no. 4, 2016, 556  
8. D. S. Krotov, V. N. Potapov, “On switching equivalence of n-ary quasigroups of order 4 and perfect binary codes”, Probl Inf Transm, 46, no. 3, 2010, 219