Alexander M. Romanov 0001
Alexander Mikhailovich Romanov 0001
Sobolev Institute of Mathematics, Novosibirsk, Russia
https://orcid.org/0000-0003-1591-1096
Alexander M. Romanov
Alexander Mikhailovich Romanov
Alexander M. Romanov 0001
Perfect mixed codes from generalized Reed-Muller codes.
1747-1759
2024
June
92
Des. Codes Cryptogr.
6
https://doi.org/10.1007/s10623-024-01364-3
https://www.wikidata.org/entity/Q128661498
db/journals/dcc/dcc92.html#Romanov24
Alexander M. Romanov 0001
On Nonlinear 1-Quasi-perfect Codes and Their Structural Properties.
141-154
2024
September
60
Probl. Inf. Transm.
3
https://doi.org/10.1134/S0032946024030013
db/journals/poit/poit60.html#Romanov24
streams/journals/poit
Alexander M. Romanov 0001
Perfect mixed codes from generalized Reed-Muller codes.
2023
abs/2312.15937
CoRR
https://doi.org/10.48550/arXiv.2312.15937
db/journals/corr/corr2312.html#abs-2312-15937
Alexander M. Romanov 0001
On the number of q-ary quasi-perfect codes with covering radius 2.
1713-1719
2022
90
Des. Codes Cryptogr.
8
https://doi.org/10.1007/s10623-022-01070-y
https://www.wikidata.org/entity/Q114849705
db/journals/dcc/dcc90.html#Romanov22
Alexander M. Romanov 0001
On Perfect and Reed-Muller Codes over Finite Fields.
199-211
2021
57
Probl. Inf. Transm.
3
https://doi.org/10.1134/S0032946021030017
db/journals/poit/poit57.html#Romanov21
Alexander M. Romanov 0001
On the number of q-ary quasi-perfect codes with covering radius 2.
2021
abs/2111.00774
CoRR
https://arxiv.org/abs/2111.00774
db/journals/corr/corr2111.html#abs-2111-00774
Alexander M. Romanov 0001
On non-full-rank perfect codes over finite fields.
995-1003
2019
87
Des. Codes Cryptogr.
5
https://doi.org/10.1007/s10623-018-0506-1
https://www.wikidata.org/entity/Q129719705
db/journals/dcc/dcc87.html#Romanov19
Alexander M. Romanov 0001
On non-full-rank perfect codes over finite fields.
2017
abs/1704.02627
CoRR
http://arxiv.org/abs/1704.02627
db/journals/corr/corr1704.html#Romanov17
Alexander M. Romanov 0001
A generalized concatenation construction for q-ary 1-perfect codes.
2017
abs/1711.00189
CoRR
http://arxiv.org/abs/1711.00189
db/journals/corr/corr1711.html#abs-1711-00189
Alexander M. Romanov 0001
Full-Rank Perfect Codes over Finite Fields.
2013
CoRR
http://arxiv.org/abs/1310.1174
abs/1310.1174
db/journals/corr/corr1310.html#Romanov13a
Alexander M. Romanov 0001
Hamiltonicity of Minimum Distance Graphs of 1-Perfect Codes.
65
2012
19
Electron. J. Comb.
1
https://doi.org/10.37236/2158
db/journals/combinatorics/combinatorics19.html#Romanov12
Alexander M. Romanov 0001
On the admissible families of components of Hamming codes
http://arxiv.org/abs/1202.0349
2012
CoRR
abs/1202.0349
db/journals/corr/corr1202.html#abs-1202-0349
Alexander M. Romanov 0001
On nonsystematic perfect binary codes of length 15.
255-258
2004
135
Discret. Appl. Math.
1-3
https://doi.org/10.1016/S0166-218X(02)00309-8
db/journals/dam/dam135.html#Romanov04