information theory; coding theory; Low-Density Parity-Check codes over GF(q); multiple access.
Main publications:
A. Frolov, V. V. Zyablov, “Bounds on the minimum code distance for nonbinary codes based on bipartite graphs”, Probl. Peredachi Inf., 47:4 (2011), 27–42
A. Frolov, V. V. Zyablov, “Asymptotic estimation of the fraction of errors correctable by q-ary LDPC codes”, Probl. Peredachi Inf., 46:2 (2010), 47–65
A. A. Frolov, “Upper bound on the minimum distance of LDPC codes over $GF(q)$ based on counting the number of syndromes”, Probl. Peredachi Inf., 52:1 (2016), 8–15; Problems Inform. Transmission, 52:1 (2016), 6–13
A. A. Frolov, V. V. Zyablov, “On the capacity of a multiple-access vector adder channel”, Probl. Peredachi Inf., 50:2 (2014), 20–30; Problems Inform. Transmission, 50:2 (2014), 133–143
D. S. Osipov, A. A. Frolov, V. V. Zyablov, “On the user capacity for a multiple-access system in a vector disjunctive channel with errors”, Probl. Peredachi Inf., 49:4 (2013), 13–27; Problems Inform. Transmission, 49:4 (2013), 308–321
D. S. Osipov, A. A. Frolov, V. V. Zyablov, “Multiple access system for a vector disjunctive channel”, Probl. Peredachi Inf., 48:3 (2012), 52–59; Problems Inform. Transmission, 48:3 (2012), 243–249
A. Frolov, V. V. Zyablov, “Bounds on the minimum code distance for nonbinary codes based on bipartite graphs”, Probl. Peredachi Inf., 47:4 (2011), 27–42; Problems Inform. Transmission, 47:4 (2011), 327–341
A. Frolov, V. V. Zyablov, “Asymptotic estimation of the fraction of errors correctable by $q$-ary LDPC codes”, Probl. Peredachi Inf., 46:2 (2010), 47–65; Problems Inform. Transmission, 46:2 (2010), 142–159
Contact us: