RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Frolov, Alexey Andreevich

Statistics Math-Net.Ru
Total publications: 6
Scientific articles: 6
Presentations: 4

Number of views:
This page:318
Abstract pages:1917
Full texts:480
References:223
Frolov, Alexey Andreevich
Candidate of physico-mathematical sciences (2012)
Speciality: 05.13.17 (Theoretical foundation for informatics)
E-mail:
Keywords: information; error-correcting codes; LDPC codes; signal-code construction; complexity; multiple access.
UDC: 621.391.15, 004.7

Subject:

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

http://www.mathnet.ru/eng/person64063
List of publications on Google Scholar
List of publications on ZentralBlatt

Publications in Math-Net.Ru
2016
1. 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  mathnet  mathscinet  elib; Problems Inform. Transmission, 52:1 (2016), 6–13  isi  elib  scopus
2014
2. A. A. Frolov, V. V. Zyablov, “On the capacity of a multiple-access vector adder channel”, Probl. Peredachi Inf., 50:2 (2014),  20–30  mathnet  mathscinet  elib; Problems Inform. Transmission, 50:2 (2014), 133–143  isi  scopus
2013
3. 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  mathnet; Problems Inform. Transmission, 49:4 (2013), 308–321  isi  scopus
2012
4. 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  mathnet; Problems Inform. Transmission, 48:3 (2012), 243–249  isi  scopus
2011
5. 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  mathnet  mathscinet; Problems Inform. Transmission, 47:4 (2011), 327–341  isi  scopus
2010
6. 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  mathnet  mathscinet; Problems Inform. Transmission, 46:2 (2010), 142–159  isi  scopus

Presentations in Math-Net.Ru
1. Коды Рида-Маллера достигают пропускной способности двоичного стирающего канала при декодировании по максимуму апостериорной вероятности (по работе С. Кудекара, М. Монделли, Э. Сасоглу и Р. Урбанке, 2015)
A. A. Frolov
Seminar on Coding Theory
November 10, 2015 19:00
2. Верхняя граница минимального кодового расстояния для МПП-кодов над полем GF(q) на основе подсчета числа синдромов
A. A. Frolov
Seminar on Coding Theory
April 14, 2015 19:00
3. Paper of Sergey Gelfand, Roland Dobrushin, Marks Pinsker "On the Complexity of Coding"
A. A. Frolov
Seminar on Coding Theory
November 5, 2013
4. Capacity for a User of a Multiple-access System in a Vector Adder Channel
A. A. Frolov
Seminar on Coding Theory
October 8, 2013 19:00

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021