| Collaborative decoding of interleaved Reed–Solomon codes and concatenated code designs G Schmidt, VR Sidorenko, M Bossert IEEE Transactions on Information Theory 55 (7), 2991-3012, 2009 | 140 | 2009 |
| Decoding of convolutional codes using a syndrome trellis V Sidorenko, V Zyablov IEEE Transactions on Information Theory 40 (5), 1663-1666, 1994 | 79 | 1994 |
| Syndrome decoding of Reed–Solomon codes beyond half the minimum distance based on shift-register synthesis G Schmidt, VR Sidorenko, M Bossert IEEE Transactions on Information Theory 56 (10), 5245-5252, 2010 | 76 | 2010 |
| Fast decoding of Gabidulin codes A Wachter-Zeh, V Afanassiev, V Sidorenko Designs, codes and cryptography 66 (1), 57-73, 2013 | 73 | 2013 |
| Skew-feedback shift-register synthesis and decoding interleaved Gabidulin codes V Sidorenko, L Jiang, M Bossert IEEE transactions on information theory 57 (2), 621-632, 2011 | 70 | 2011 |
| Decoding Reed-Solomon codes beyond half the minimum distance using shift-register synthesis G Schmidt, V Sidorenko, M Bossert 2006 IEEE International Symposium on Information Theory, 459-463, 2006 | 47 | 2006 |
| Convolutional codes in rank metric with application to random network coding A Wachter-Zeh, M Stinner, V Sidorenko IEEE Transactions on Information Theory 61 (6), 3199-3213, 2015 | 45 | 2015 |
| Minimal trellis design for linear codes based on the Shannon product V Sidorenko, G Markarian, B Honary IEEE Transactions on Information Theory 42 (6), 2048-2053, 1996 | 44 | 1996 |
| Code constructions for physical unclonable functions and biometric secrecy systems O Günlü, O İşcan, V Sidorenko, G Kramer IEEE Transactions on Information Forensics and Security 14 (11), 2848-2858, 2019 | 43 | 2019 |
| Secure and reliable key agreement with physical unclonable functions O Günlü, T Kernetzky, O İşcan, V Sidorenko, G Kramer, RF Schaefer Entropy 20 (5), 340, 2018 | 42 | 2018 |
| Bounds on complexity of trellis decoding of linear block codes VV Zyablov, VR Sidorenko Problemy Peredachi Informatsii 29 (3), 3-9, 1993 | 41 | 1993 |
| Array codes correcting a two-dimensional cluster of errors M Breitbach, M Bossert, V Zyablov, V Sidorenko IEEE Transactions on Information Theory 44 (5), 2025-2031, 1998 | 40 | 1998 |
| Linearized shift-register synthesis V Sidorenko, G Richter, M Bossert IEEE Transactions on Information Theory 57 (9), 6025-6032, 2011 | 38 | 2011 |
| Decoding interleaved Gabidulin codes and multisequence linearized shift-register synthesis V Sidorenko, M Bossert 2010 IEEE International Symposium on Information Theory, 1148-1152, 2010 | 34 | 2010 |
| On (partial) unit memory codes based on Gabidulin codes A Wachter, VR Sidorenko, M Bossert, VV Zyablov Problems of Information Transmission 47 (2), 117-129, 2011 | 30 | 2011 |
| Fast skew-feedback shift-register synthesis V Sidorenko, M Bossert Designs, Codes and Cryptography 70 (1), 55-67, 2014 | 28 | 2014 |
| Multi-sequence linear shift-register synthesis: The varying length case G Schmidt, VR Sidorenko 2006 IEEE International Symposium on Information Theory, 1738-1742, 2006 | 28 | 2006 |
| Concatenation of convolutional codes and rank metric codes for multi-shot network coding D Napp, R Pinto, V Sidorenko Designs, Codes and Cryptography 86, 303-318, 2018 | 27 | 2018 |
| Decoding punctured Reed-Solomon codes up to the Singleton bound V Sidorenko, G Schmidt, M Bossert 7th International ITG Conference on Source and Channel Coding, 1-6, 2008 | 26 | 2008 |
| Singleton-type bounds for blot-correcting codes M Bossert, V Sidorenko IEEE Transactions on Information Theory 42 (3), 1021-1023, 1996 | 24 | 1996 |