Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Romanov, Alexander Mikhailovich
Statistics Math-Net.Ru
Total publications: 12
Scientific articles: 12

Number of views:
This page:1061
Abstract pages:3870
Full texts:1331
References:324
Senior Researcher
Candidate of physico-mathematical sciences (1988)
Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
Birth date: 07.10.1954
E-mail: ,
Keywords: boolean cube; hamiltonian cycles; latin squares; n-quasigroups; perfect codes; nonlinear codes.
   
Main publications:
  • Romanov A. M. New binary codes of minimal distance 3 // PPI. 1983. V. 19. P. 101–102.

https://www.mathnet.ru/eng/person17464
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/211871

Publications in Math-Net.Ru Citations
2021
1. A. M. Romanov, “On perfect and Reed–Muller codes over finite fields”, Probl. Peredachi Inf., 57:3 (2021),  3–16  mathnet; Problems Inform. Transmission, 57:3 (2021), 199–211  isi  scopus 6
2016
2. A. M. Romanov, “On the embedding of constant-weight codes into perfect codes”, Diskretn. Anal. Issled. Oper., 23:4 (2016),  26–34  mathnet  mathscinet  elib; J. Appl. Industr. Math., 10:4 (2016), 556–559  scopus
3. A. M. Romanov, “On full-rank perfect codes over finite fields”, Diskretn. Anal. Issled. Oper., 23:3 (2016),  107–123  mathnet  mathscinet  elib; J. Appl. Industr. Math., 10:3 (2016), 444–452  scopus 1
2012
4. A. M. Romanov, “On the admissible families of components of Hamming codes”, Diskretn. Anal. Issled. Oper., 19:2 (2012),  84–91  mathnet  mathscinet; J. Appl. Industr. Math., 6:3 (2012), 355–359 3
2009
5. A. M. Romanov, “On combinatorial Gray codes with distance 3”, Diskr. Mat., 21:3 (2009),  73–78  mathnet  mathscinet  elib; Discrete Math. Appl., 19:4 (2009), 383–388  scopus 2
2006
6. A. M. Romanov, “A survey of methods for constructing nonlinear perfect binary codes”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:4 (2006),  60–88  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 2:2 (2008), 252–269  scopus 5
2004
7. A. M. Romanov, “On partitions of $q$-ary Hamming codes into disjoint components”, Diskretn. Anal. Issled. Oper., Ser. 1, 11:3 (2004),  80–87  mathnet  mathscinet  zmath 9
2002
8. S. A. Malyugin, A. M. Romanov, “On partitions of Hamming codes into disjoint components”, Diskretn. Anal. Issled. Oper., Ser. 1, 9:1 (2002),  42–48  mathnet  mathscinet  zmath 3
2000
9. A. M. Romanov, “Perfect binary codes with a trivial kernel”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:2 (2000),  71–74  mathnet  mathscinet  zmath 3
1997
10. A. M. Romanov, “On nonsystematic perfect codes of length 15”, Diskretn. Anal. Issled. Oper., Ser. 1, 4:4 (1997),  75–78  mathnet  mathscinet  zmath 12
11. A. M. Romanov, “On the construction of perfect nonlinear binary codes by symbol inversion”, Diskretn. Anal. Issled. Oper., Ser. 1, 4:1 (1997),  46–52  mathnet  mathscinet  zmath 12
1983
12. A. M. Romanov, “New Binary Codes with Minimum Distance 3”, Probl. Peredachi Inf., 19:3 (1983),  101–102  mathnet  zmath

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024