PARTIALLY-REGULAR LDPC CODES WITH LINEAR ENCODING COMPLEXITY AND IMPROVED THRESHOLDS
IEEE International Symposium on Information Theory - Proceedings Сер. "2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011" P. 528-532.
Braided Code Division Multiple Access, Proceedings of NATO ASI on Coding and Analysis of Multiple Access Channels 2006, Budapest, Hungary, August-September 2006.
Irregular Low-Density Parity-Check Convolutional Codes Based on Protographs", 2006 IEEE International Symposium on Information Theory, Seattle, Washington, USA, July 2006.
Декодирование низкоплотностных кодов с проверочными матрицами, составленными из перестановочных матриц, при передаче по каналу со стираниями,
Пробл. передачи информ., 2006, 42:2, 44–52 Перейти к публикации
On the Erasure Correction Capability of LDPC Codes//2006 IEEE International Symposium
on Information Theory July 9 - July 14, 2006 The Westin Seattle • Seattle, Washington Перейти к публикацииЗагрузить (98.1 KB)
2005 г.
Авторы: Шридхаран А., Лентмайер, М., В. Трухачев Д., Дж. Костелло Д., Зигангиров К.Ш.
О минимальном расстоянии низкоплотностных кодов с проверочными матрицами, составленными из перестановочных матриц, Пробл. передачи информ., 2005, 41:1, 39–52
2004 г.
Авторы: Shridharan A., Truhachev D., Lentmaier M., Зигангиров К.Ш.
On the Free Distance of LDPC Convolutional Codes
International Symposium on Information Theory, ISIT 2004. Proceedings., pp. 312-, 2004-07-02.
2004 г.
Авторы: Зигангиров К.Ш., Truhachev D., Truhachev D., J. Costello D.
Turbo codes and Shannon"s condition for reliable communication
International Symposium on Information Theory, 2004. ISIT 2004. Proceedings., International Symposium on Information Theory, ISIT 2004, pp. 442-, 2004-06-27/2004-07-02.
Analytic expressions for the bit error probabilities of rate-1/2 memory 2 convolutional encoders
IEEE Transactions on Information Theory, Vol. 50, No. 6, pp. 1303-1311, 2004.
On permutor designs based on cycles for serially concatenated convolutional codes
IEEE TRANSACTIONS ON COMMUNICATIONS, Vol. 52, No. 9, pp. 1494-1503, 2004.
On cycle-based permutor designs for serially concatenated codes,
IEEE International Symposium on Information Theory, 2003. Proceedings., ISIT-2003, Chicago, USA, pp. 279-, 2003.
On bandwidth-efficient convolutional LDPC codes,
IEEE International Symposium on Information Theory - Proceedings, Proceedings 2003 IEEE International Symposium on Information Theory (ISIT), Yokohama, Japan, pp. 235-235, Jun 29-Jul 4 2003.
On braided block codes,
Proceedings 2003 IEEE International Symposium on Information Theory. ISIT 2003 (Cat. No.03CH37432), Yokohama, Japan, pp. 32-32, 29 June-4 July 2003.
Asymptotic analysis of superorthogonal turbo codes
IEEE Transactions on Information Theory, Vol. 49, No. 1, pp. 253-258, 2003.
2002 г.
Авторы: Truhachev D., Lentmaier M., Wintzell O., Зигангиров К.Ш.
On the minimum distance of turbo codes,
IEEE International Symposium on Information Theory - Proceedings, 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland, pp. 84-84, Jun 30-Jul 5 2002.
Analytic expression for the exact bit error probability of the (7,5) convolutional code
IEEE International Symposium on Information Theory - Proceedings, 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland, pp. 7-7, Jun 30-Jul 5 2002.
Two approaches to the analysis of low-density parity-check codes,
Proceedings 2002 IEEE International Symposium on Information Theory (Cat. No.02CH37371), Proceedings of IEEE International Symposium on Information Theory, Lausanne, Switzerland, pp. 29-29, 30 June-5 July 2002.
On the capacity of a pulse-position-hopped CDMA system Information Theory, IEEE Transactions on Inf. Theory, Volume 47, Issue 6, Sep 2001 Page(s):2639 – 2644
A simple one sweep algorithm for optimal APP symbol decoding of linear block codes
IEEE Transactions on Information Theory, Vol. 44, No. 7, pp. 3124-3129, 1998.
Implementation and some applications of the algebraic-sequential decoder.
Seventh Joint Swedish-Russian International Workshop on Information Theory,
Proceedings, June 17-22, 1995, St.-Petersburg, P.60-67.
Чепыжов В.В. Недвоичное сверточное кодирование в канале с преднамеренными помехами.
Проблемы передачи информации. Т.31. 1995. N.2. С.84-101. Перейти к публикации
A Gilbert-Varshamov bound for Quasi-Twisted codes of rate 1/n.
Sixth Joint Swedish-Russian International Workshop on Information Theory, Proceedings, August 22-27, 1993, Molle, Sweden, P.214-218.
Performance of q-ary convolutional codes on jamming channels.
Sixth Joint Swedish-Russian International Workshop on Information Theory, Proceedings, August 22-27, 1993, Molle, Sweden, P.38-41.
The free distance of fixed convolutional rate 2/4 codes meets the Costello bound.
Trans. IEEE on Inf. Theory. V.IT-38. 1992. N.4. P.1360-1366. Перейти к публикации
О существовании постоянных во времени сверточных кодов со скоростью 2/c, c>3, достигающих границы Костелло.
Проблемы передачи информации. Т. 27. 1991. N.3. P.16-29. Перейти к публикации
Study of decoding tail biting convolutional codes.
Fourth Joint Swedish-Soviet International Workshop on Informational Theory, August 27 - September 1, 1989, Gotland, Sweden, P.52-55.
Distances and distance bounds for convolutional codes - an overview
Topics in coding theory - in honour of Lars H. Zetterberg, pp. 109-136, ISBN 0-387-51405-8, Springer-Verlag, 1989.
