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" 2011. С. 528-532.

A Comparison between LDPC block and convolutional codes, Information Theory and Applications Workshop, San Diego, USA, February 2006.

On the Erasure Correction Capability of LDPC Codes//2006 IEEE International Symposium on Information Theory Sunday, July 9 -Friday, July 14, 2006 The Westin Seattle • Seattle, Washington
Go to publication Download (98.1 KB)

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.

Nonbinary convolutional coding in channels with jamming. Problems of Information Transmission. V.31. 1995. N.2. P.169–183
Go to publication

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.
Go to publication

Existence of time-invariant convolutional codes with transmission rate $2/c$ for $c geq{}4$ attaining the Costello bound. Probl. Inf. Transm. V.27. 1991. No.3. P.199-211.
Go to publication

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.