Frolov Alexey Andreevich

Publications in Math-Net.Ru

1. 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
2. On the capacity of a multiple-access vector adder channel
   
   Probl. Peredachi Inf., 50:2 (2014),  20–30
3. On the user capacity for a multiple-access system in a vector disjunctive channel with errors
   
   Probl. Peredachi Inf., 49:4 (2013),  13–27
4. Multiple access system for a vector disjunctive channel
   
   Probl. Peredachi Inf., 48:3 (2012),  52–59
5. Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
   
   Probl. Peredachi Inf., 47:4 (2011),  27–42
6. Asymptotic estimation of the fraction of errors correctable by $q$-ary LDPC codes
   
   Probl. Peredachi Inf., 46:2 (2010),  47–65