RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Sidorenko, Vladimir Removich

Statistics Math-Net.Ru
Total publications: 14
Scientific articles: 14
Presentations: 1

Number of views:
This page:384
Abstract pages:3896
Full texts:1391
References:219
E-mail:

http://www.mathnet.ru/eng/person34669
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/341506

Publications in Math-Net.Ru
2012
1. J. Weber, V. R. Sidorenko, C. Senger, K. Abdel-Ghaffar, “Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff”, Probl. Peredachi Inf., 48:4 (2012),  30–40  mathnet; Problems Inform. Transmission, 48:12 (2012), 324–333  isi
2011
2. V. R. Sidorenko, G. Schmidt, “A linear algebraic approach to multisequence shift-register synthesis”, Probl. Peredachi Inf., 47:2 (2011),  72–89  mathnet  mathscinet; Problems Inform. Transmission, 47:2 (2011), 149–165  isi  scopus
3. A. Wachter, V. R. Sidorenko, M. Bossert, V. V. Zyablov, “On (partial) unit memory codes based on Gabidulin codes”, Probl. Peredachi Inf., 47:2 (2011),  38–51  mathnet  mathscinet; Problems Inform. Transmission, 47:2 (2011), 117–129  isi  scopus
2010
4. C. Senger, V. R. Sidorenko, M. Bossert, V. V. Zyablov, “Multitrial decoding of concatenated codes using fixed thresholds”, Probl. Peredachi Inf., 46:2 (2010),  30–46  mathnet  mathscinet; Problems Inform. Transmission, 46:2 (2010), 127–141  isi  scopus
2006
5. C. Medina, V. R. Sidorenko, V. V. Zyablov, “Error Exponents for Product Convolutional Codes”, Probl. Peredachi Inf., 42:3 (2006),  3–20  mathnet  mathscinet; Problems Inform. Transmission, 42:3 (2006), 167–182  scopus
2002
6. H. Grießer, V. R. Sidorenko, “A Posteriory Probability Decoding of Nonsystematically Encoded Block Codes”, Probl. Peredachi Inf., 38:3 (2002),  20–33  mathnet  mathscinet  zmath; Problems Inform. Transmission, 38:3 (2002), 182–193
1997
7. M. Bossert, M. Breitbach, V. V. Zyablov, V. R. Sidorenko, “Codes Correcting a Set of Clusters of Errors or Erasures”, Probl. Peredachi Inf., 33:4 (1997),  15–25  mathnet  mathscinet  zmath; Problems Inform. Transmission, 33:4 (1997), 297–306
8. V. R. Sidorenko, “The Euler Characteristic of the Minimal Code Trellis is Maximum”, Probl. Peredachi Inf., 33:1 (1997),  87–93  mathnet  mathscinet  zmath; Problems Inform. Transmission, 33:1 (1997), 72–77
1993
9. V. V. Zyablov, V. G. Potapov, V. R. Sidorenko, “Maximum-Likelihood List Decoding Using Trellises”, Probl. Peredachi Inf., 29:4 (1993),  3–10  mathnet  mathscinet  zmath; Problems Inform. Transmission, 29:4 (1993), 299–305
10. V. V. Zyablov, V. R. Sidorenko, “Bounds on Complexity of Trellis Decoding of Linear Block Codes”, Probl. Peredachi Inf., 29:3 (1993),  3–9  mathnet  mathscinet  zmath; Problems Inform. Transmission, 29:3 (1993), 203–208
1992
11. V. V. Zyablov, V. R. Sidorenko, “Soft-Decision Maximum-Likelihood Decoding of Partial-Unit-Memory Codes”, Probl. Peredachi Inf., 28:1 (1992),  22–27  mathnet  zmath; Problems Inform. Transmission, 28:1 (1992), 18–22
1976
12. È. M. Gabidulin, V. R. Sidorenko, “On One General Bound for Code Volume”, Probl. Peredachi Inf., 12:4 (1976),  31–35  mathnet  mathscinet  zmath; Problems Inform. Transmission, 12:4 (1976), 266–269
13. V. R. Sidorenko, “Class of Correcting Codes for Errors With a Lattice Configuration”, Probl. Peredachi Inf., 12:3 (1976),  3–12  mathnet  mathscinet  zmath; Problems Inform. Transmission, 12:3 (1976), 165–171
1975
14. V. R. Sidorenko, “An Upper Bound on the Volume of $q$-ary Codes”, Probl. Peredachi Inf., 11:3 (1975),  14–20  mathnet  mathscinet  zmath; Problems Inform. Transmission, 11:3 (1975), 190–194

Presentations in Math-Net.Ru
1. Hermitian Ņodes that Correct Error Bursts
V. R. Sidorenko
Seminar on Coding Theory
December 24, 2013 19:00

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021