Dmitrii V. Zinoviev
Affiliations:- Russian Academy of Sciences, Moscow, Russia
  According to our database1,
  Dmitrii V. Zinoviev
  authored at least 39 papers
  between 1995 and 2024.
  
  
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
  2024
    Probl. Inf. Transm., December, 2024
    
  
  2023
On the Classification of Completely Regular Codes with Covering Radius Two and Antipodal Duals.
    
  
    Probl. Inf. Transm., July, 2023
    
  
On the classification of completely regular codes with covering radius two and antipodal dual.
    
  
    CoRR, 2023
    
  
  2022
  2021
On the Generalized Concatenated Construction for the Nordstrom-Robinson Code and the Binary Golay Code.
    
  
    Probl. Inf. Transm., 2021
    
  
On the Generalized Concatenated Construction for Codes in L<sub>1</sub> and Lee Metrics.
    
  
    Probl. Inf. Transm., 2021
    
  
  2020
    Probl. Inf. Transm., 2020
    
  
    Proceedings of the Algebraic and Combinatorial Coding Theory, 2020
    
  
  2019
  2016
    Probl. Inf. Transm., 2016
    
  
  2014
    Probl. Inf. Transm., 2014
    
  
  2013
Structure of steiner triple systems <i>S</i>(2<sup>m</sup> - 1, 3, 2) of rank 2<sup>m</sup> - <i>m</i> + 2 over (𝔽<sub>2</sub>).
    
  
    Probl. Inf. Transm., 2013
    
  
Remark on "Steiner triple systems <i>S</i>(2<sup>m</sup> - 1, 3, 2) of rank 2<sup>m</sup> -<i>m</i>+ 1 over (𝔽<sub>2</sub>)" published in <i>Probl. Peredachi Inf.</i>, 2012, no. 2.
    
  
    Probl. Inf. Transm., 2013
    
  
  2012
Steiner triple systems <i>S</i>(2<sup>m</sup> - 1, 3, 2) of rank 2<sup>m</sup> - <i>m</i>+ 1 over (𝔽<sub>2</sub>).
    
  
    Probl. Inf. Transm., 2012
    
  
  2011
    Probl. Inf. Transm., 2011
    
  
  2010
Binary perfect and extended perfect codes of lengths 15 and 16 and of ranks 13 and 14.
    
  
    Probl. Inf. Transm., 2010
    
  
  2009
    Probl. Inf. Transm., 2009
    
  
  2008
The Peak to Sidelobe Level of the Most Significant Bit of Trace Codes over Galois Rings.
    
  
    Proceedings of the Sequences and Their Applications, 2008
    
  
  2007
On resolvability of Steiner systems <i>S</i>(<i>v</i> = 2<sup>m</sup>, 4, 3) of rank <i>r</i> ≤ <i>v - m</i> + 1 over (𝔽<sub>2</sub>).
    
  
    Probl. Inf. Transm., 2007
    
  
    Proceedings of the IEEE International Symposium on Information Theory, 2007
    
  
    Proceedings of the Cryptography and Coding, 2007
    
  
  2006
    IEEE Trans. Inf. Theory, 2006
    
  
    Probl. Inf. Transm., 2006
    
  
Vasil'ev codes of length <i>n</i> = 2<sup>m</sup> and doubling of Steiner systems <i>S</i>(<i>n</i>, 4, 3) of a given rank.
    
  
    Probl. Inf. Transm., 2006
    
  
  2004
The Most Significant Bit of Maximum-Length Sequences Over BBZ<sub>2</sub><sup>l</sup>: Autocorrelation and Imbalance.
    
  
    IEEE Trans. Inf. Theory, 2004
    
  
    Probl. Inf. Transm., 2004
    
  
    Probl. Inf. Transm., 2004
    
  
    Probl. Inf. Transm., 2004
    
  
    Proceedings of the Sequences and Their Applications, 2004
    
  
Distribution of r-Patterns in the Most Significant Bit of a Maximum Length Sequence over.
    
  
    Proceedings of the Sequences and Their Applications, 2004
    
  
  2002
Binary Extended Perfect Codes of Length 16 by the Generalized Concatenated Construction.
    
  
    Probl. Inf. Transm., 2002
    
  
  1995
    IEEE Trans. Inf. Theory, 1995