Dr. Vladimir Sidorenko
Technical University of Munich: Munich, DE
+1
'%3e%3cpath%20d='M22.1642%2019.0924C21.7317%2018.068%2021.1041%2017.1375%2020.3163%2016.3527C19.5309%2015.5656%2018.6006%2014.9381%2017.5766%2014.5048C17.5674%2014.5002%2017.5582%2014.4979%2017.5491%2014.4933C18.9774%2013.4616%2019.9059%2011.7811%2019.9059%209.88504C19.9059%206.74408%2017.3611%204.19922%2014.2201%204.19922C11.0792%204.19922%208.53429%206.74408%208.53429%209.88504C8.53429%2011.7811%209.46282%2013.4616%2010.8912%2014.4956C10.882%2014.5002%2010.8728%2014.5025%2010.8636%2014.5071C9.83652%2014.9404%208.91487%2015.5617%208.1239%2016.355C7.33685%2017.1404%206.70933%2018.0707%206.276%2019.0947C5.85031%2020.0972%205.62072%2021.172%205.59967%2022.2609C5.59905%2022.2853%205.60335%2022.3097%205.61229%2022.3325C5.62123%2022.3553%205.63465%2022.376%205.65174%2022.3935C5.66883%2022.4111%205.68926%2022.425%205.71182%2022.4345C5.73437%2022.444%205.7586%2022.4489%205.78308%2022.4489H7.15868C7.25956%2022.4489%207.3398%2022.3686%207.3421%2022.2701C7.38795%2020.5001%208.09868%2018.8425%209.35506%2017.5861C10.655%2016.2862%2012.3814%2015.5709%2014.2201%2015.5709C16.0588%2015.5709%2017.7852%2016.2862%2019.0852%2017.5861C20.3415%2018.8425%2021.0523%2020.5001%2021.0981%2022.2701C21.1004%2022.3709%2021.1807%2022.4489%2021.2815%2022.4489H22.6571C22.6816%2022.4489%2022.7058%2022.444%2022.7284%2022.4345C22.751%2022.425%2022.7714%2022.4111%2022.7885%2022.3935C22.8056%2022.376%2022.819%2022.3553%2022.8279%2022.3325C22.8369%2022.3097%2022.8412%2022.2853%2022.8406%2022.2609C22.8176%2021.165%2022.5907%2020.0989%2022.1642%2019.0924ZM14.2201%2013.8284C13.1678%2013.8284%2012.1773%2013.418%2011.4322%2012.6729C10.6871%2011.9278%2010.2767%2010.9374%2010.2767%209.88504C10.2767%208.83271%2010.6871%207.84227%2011.4322%207.09715C12.1773%206.35204%2013.1678%205.94165%2014.2201%205.94165C15.2724%205.94165%2016.2629%206.35204%2017.008%207.09715C17.7531%207.84227%2018.1635%208.83271%2018.1635%209.88504C18.1635%2010.9374%2017.7531%2011.9278%2017.008%2012.6729C16.2629%2013.418%2015.2724%2013.8284%2014.2201%2013.8284Z'%20fill='%238590A2'/%3e%3c/g%3e%3c/svg%3e)
Co-authors
Following
Followers
Research Focus & Metrics
Explore full metrics on Scilit
Academic Career Length
39Years (1988-Present)
(Calculated once Scilit publication data is synced: current year − year of first publication + 1)
Representative Publications
View All Publications16 June 2009 in IEEE Transactions on Information Theory
Journal Article
Interleaved Reed-Solomon codes are applied in numerous data processing, data transmission, and data storage systems. They are generated by interleaving several codewords of ordinary Reed-Solomon codes. Usually, these codewords are decoded independently by classical algebraic decoding methods. However, by collaborative algebraic decoding approaches, such interleaved schemes allow the correction of error patterns beyond half the minimum distance, provided that the errors in the received signal occur in bursts. In this work, collaborative decoding of interleaved Reed-Solomon codes by multisequence shift-register synthesis is considered and analyzed. Based on the framework of interleaved Reed-Solomon codes, concatenated code designs are investigated, which are obtained by interleaving several Reed-Solomon codes, and concatenating them with an inner code.
1 January 1994 in IEEE Transactions on Information Theory
Journal Article
Vladimir SidorenkoVZV. Zyablov
V. ZyablovSoft-decision maximum-likelihood decoding of convolutional codes using the Viterbi algorithm with a syndrome trellis is proposed. The parity check matrix of a convolutional code is used to construct the trellis. This trellis is minimal. The number of operations for the decoding of one block of a q-ary rate k/n convolutional code is ~nqmin(k,n-k)qν, where ν is the memory size of the code. When the code rate satisfies k/n>½, the proposed algorithm is simpler than the classical Viterbi algorithm that has complexity ~nqkqν
21 April 2015 in IEEE Transactions on Information Theory
Journal Article
AWAntonia Wachter-Zeh
Antonia Wachter-Zeh
MSMarkus Stinner
Markus Stinner
Vladimir SidorenkoRandom network coding recently attracts attention as a technique to disseminate information in a network. This paper considers a noncoherent multishot network, where the unknown and time-variant network is used several times. In order to create dependence between the different shots, particular convolutional codes in rank metric are used. These codes are so-called (partial) unit memory ((P)UM) codes, i.e., convolutional codes with memory one. First, distance measures for convolutional codes in rank metric are shown and two constructions of (P)UM codes in rank metric based on the generator matrices of maximum rank distance codes are presented. Second, an efficient error-erasure decoding algorithm for these codes is presented. Its guaranteed decoding radius is derived and its complexity is bounded. Finally, it is shown how to apply these codes for error correction in random linear and affine network coding.
13 September 2010 in IEEE Transactions on Information Theory
Journal Article
In this paper, a new approach for decoding low-rate Reed-Solomon codes beyond half the minimum distance is considered and analyzed. The maximum error correcting radius coincides with the error correcting radius of the Sudan algorithm published in 1997. However, unlike the Sudan Algorithm, the approach described here is not a list decoding algorithm, and is not based on polynomial interpolation. The algorithm in this paper is rather syndrome based, like classical algebraic decoding algorithms. The computational complexity of the new algorithm is of the same order as the complexity of the well-known Berlekamp-Massey algorithm. To decode errors beyond half the minimum distance, the new decoder is allowed to fail for some high-weight error patterns with a very small probability.
Journal Article
Onur GünlüTKTasnad Kernetzky
Tasnad KernetzkyOİOnurcan İşcan
Onurcan İşcanVladimir Sidorenko
Gerhard KramerRSRafael F. Schaefer
Rafael F. SchaeferDifferent transforms used in binding a secret key to correlated physical-identifier outputs are compared. Decorrelation efficiency is the metric used to determine transforms that give highly-uncorrelated outputs. Scalar quantizers are applied to transform outputs to extract uniformly distributed bit sequences to which secret keys are bound. A set of transforms that perform well in terms of the decorrelation efficiency is applied to ring oscillator (RO) outputs to improve the uniqueness and reliability of extracted bit sequences, to reduce the hardware area and information leakage about the key and RO outputs, and to maximize the secret-key length. Low-complexity error-correction codes are proposed to illustrate two complete key-binding systems with perfect secrecy, and better secret-key and privacy-leakage rates than existing methods. A reference hardware implementation is also provided to demonstrate that the transform-coding approach occupies a small hardware area.
15 April 2019 in IEEE Transactions on Information Forensics and Security
Journal Article
Onur GünlüOİOnurcan İşcan
Onurcan İşcanVladimir SidorenkoGerhard KramerThis article describes how to use the IEEEtran class with LaTeX to produce high quality typeset papers that are suitable for submission to the Institute of Electrical and Electronics Engineers. IEEEtran can produce conference, journal and technical note (correspondence) papers with a suitable choice of class options. This document was produced using IEEEtran in journal mode.
About Me
Vladimir Sidorenko was born in Krasnoyarsk, Russia. He received the M.S. degree in electrical engineering in 1972 and the Ph.D. degree in mathematics in 1975 both from the Moscow Institute for Physics and Technology. From 1975 to 1983 he was with Computer center of 4th Department of Russian Health Ministry, first as a senior engineer and then as the vise director of the Computer center. In 1983 he joined the Institute for Information Transmission Problems (IITP), Russian Academy of Sciences, Moscow, as a senior research fellow. From 2003 till 2014 he was a senior researcher of Institute of Communications Engineering, Ulm University, where he reserved In-centi award for the best lecturing. From January 2015 he is a senior researcher at Institute for Communications Engineering of Technical University of Munich, Germany, on leave from IITP. As invited researcher he worked at University of Lund, Sweden, Technical University of Darmstadt, Germany, University of Lancaster, UK, University of Aveiro, Portugal, and Southwest Jiaotong University, Chengdu, China. His research interests include coding theory, telecommunications, signal processing, cryptology, and applications. He has published more than 150 research papers in these fields.