60 citations · 151 across the 27 of their papers we have counts for
4 papers · 1 filter
On the metric dimension of Cartesian powers of a graph
Zilin Jiang, Nikita Polyanskii
A set of vertices resolves a graph if every vertex is uniquely determined by its vector of distances to the vertices in . The metric dimension of a graph is the minimum card…
Floor Scale Modulo Lifting for QC-LDPC codes
Nikita Polyanskii, Vasiliy Usatyuk, Ilya Vorobyev
In the given paper we present a novel approach for constructing a QC-LDPC code of smaller length by lifting a given QC-LDPC code. The proposed method can be considered as a general…
Hypothesis Test for Bounds on the Size of Random Defective Set
A. G. D'yachkov, N. A. Polyanskii, V. Yu. Shchukin +1
The conventional model of disjunctive group testing assumes that there are several defective elements (or defectives) among a large population, and a group test yields the positive…
Separable Codes for the Symmetric Multiple-Access Channel
A. G. Dyachkov, N. Polyanskii, V. Shchukin +1
A binary matrix is called an s-separable code for the disjunctive multiple-access channel (disj-MAC) if Boolean sums of sets of s columns are all distinct. The well-known issue of…