S. Litsyn

Erratum to "Intersecting codes and separating codes": [Discrete Applied Mathematics 128 (2003) 75-83]

Gérard D. Cohen, Hans Georg Schaathun, S. Encheva, 2003, Discret. Appl. Math..

Error Correcting Codes With Bounded Running Digital Sum

S. Litsyn, H. van Tilborg, M. Blanni, 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

Discrete and continuous maxima in OFDM signals

S. Litsyn, I. Alrod, 2004, 2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel.

A new upper bound on the reliability function of the Gaussian channel

S. Litsyn, A. Barg, A. Ashikhmin, 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

Estimates of the distance distribution of codes and designs

S. Litsyn, A. Barg, S. Litsyn, 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

An efficient message-passing schedule for LDPC decoding

S. Litsyn, J. Goldberger, S. Litsyn, 2004, 2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel.

On binary constructions of quantum codes

S. Litsyn, G. Cohen, S. Litsyn, 1998, Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253).

New upper bounds on the covering radius of codes with known dual distance

S. Litsyn, S. Litsyn, A. Tietavainen, 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

Upper bounds on the size of quantum codes

S. Litsyn, S. Litsyn, A. Ashikhmin, 1997, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).