Nikita Polyanskii
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Codes for the Z-channel IEEE Transactions on Information Theory | 2024-07-19 | Paper |
| Systematic Codes Correcting Multiple-Deletion and Multiple-Substitution Errors IEEE Transactions on Information Theory | 2024-03-14 | Paper |
| Coding With Noiseless Feedback Over the Z-Channel IEEE Transactions on Information Theory | 2022-07-13 | Paper |
| Lifted Reed-Solomon Codes and Lifted Multiplicity Codes IEEE Transactions on Information Theory | 2022-02-17 | Paper |
| Feedback insertion-deletion codes Problems of Information Transmission | 2022-01-20 | Paper |
| On list decoding of certain \(\mathbb{F}_q\)-linear codes Problems of Information Transmission | 2022-01-20 | Paper |
| Quadratic-Curve-Lifted Reed-Solomon Codes | 2021-09-29 | Paper |
| Coding in a Z-channel in case of many errors Problems of Information Transmission | 2021-08-04 | Paper |
| Codes for the Z-channel | 2021-05-04 | Paper |
| Coding with noiseless feedback over the Z-channel (available as arXiv preprint) | 2021-04-21 | Paper |
| Binary Batch Codes With Improved Redundancy IEEE Transactions on Information Theory | 2020-12-04 | Paper |
| Coding with Noiseless Feedback over the Z-channel (available as arXiv preprint) | 2020-07-08 | Paper |
| Hypothesis Test for Bounds on the Size of Random Defective Set IEEE Transactions on Signal Processing | 2019-10-28 | Paper |
| How to guess an \(n\)-digit number Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
| Separable Codes for the Symmetric Multiple-Access Channel IEEE Transactions on Information Theory | 2019-07-19 | Paper |
| On Capacities of the Two-User Union Channel With Complete Feedback IEEE Transactions on Information Theory | 2019-07-19 | Paper |
| On the metric dimension of Cartesian powers of a graph Journal of Combinatorial Theory. Series A | 2019-06-25 | Paper |
| Constructions of Batch Codes via Finite Geometry | 2019-01-20 | Paper |
| Almost cover-free codes Problems of Information Transmission | 2017-07-21 | Paper |
| Erratum to: ``Bounds on the rate of disjunctive codes'' Problems of Information Transmission | 2017-07-21 | Paper |
| Symmetric disjunctive list-decoding codes Designs, Codes and Cryptography | 2017-02-10 | Paper |
| Cover-free codes and separating system codes Designs, Codes and Cryptography | 2017-02-10 | Paper |
| Almost cover-free codes and designs Designs, Codes and Cryptography | 2017-02-10 | Paper |
| Almost disjunctive list-decoding codes Problems of Information Transmission | 2016-03-18 | Paper |
| On a Hypergraph Approach to Multistage Group Testing Problems | 2016-01-25 | Paper |
| Bounds on the rate of disjunctive codes Problems of Information Transmission | 2015-03-17 | Paper |
| DNA codes for nonadditive stem similarity Problems of Information Transmission | 2015-03-17 | Paper |
Research outcomes over time
This page was built for person: Nikita Polyanskii
