Vladislav Y. Shchukin
Revision as of 16:59, 1 October 2019 by GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Vladislav Y. Shchukin''' '''Vladislav Y. Shchukin''',<br/> a Russian mathematician and computer scientist, since 2013 graduate student at...")
Home * People * Vladislav Y. Shchukin
Vladislav Y. Shchukin,
a Russian mathematician and computer scientist, since 2013 graduate student at Faculty of Computational Mathematics and Cybernetics, Moscow State University.
His research interests include coding theory and data compression.
Along with Victor Zakharov and Michael G. Malkovsky, he worked and published on compression of the 7-piece Lomonosov Tablebases, whose algorithms are based on data reordering before compression, the RE-PAIR compression algorithm, and use of the so-called underdetermined value method [1] [2].
Selected Publications
- Arkady G. Dyachkov, Ilya V. Vorobyov, N.A. Polyansky, Vladislav Y. Shchukin (2014). Bounds on the rate of disjunctive codes. Problems of Information Transmission, Maik Nauka, Vol. 50, No. 1
- Arkady G. Dyachkov, Ilya V. Vorobyov, N.A. Polyansky, Vladislav Y. Shchukin (2015). Almost Disjunctive List-Decoding Codes. Problems of Information Transmission, Maik Nauka, Vol. 51, No. 2
- Victor Zakharov, Michael G. Malkovsky, Vladislav Y. Shchukin (2016). Compression of underdetermined data in a 7-piece chess table. Moscow University Computational Mathematics and Cybernetics, Vol. 40, No. 1
External Links
References
- ↑ Victor Zakharov, Michael G. Malkovsky, Vladislav Y. Shchukin (2016). Compression of underdetermined data in a 7-piece chess table. Moscow University Computational Mathematics and Cybernetics, Vol. 40, No. 1
- ↑ tablebase compression / academic integrity by Ronald de Man, CCC, May 19, 2016
- ↑ Щукин Владислав Юрьевич
