#### Filter Results:

- Full text PDF available (59)

#### Publication Year

1986

2017

- This year (0)
- Last 5 years (6)
- Last 10 years (35)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Uri Erez, Simon Litsyn, Ram Zamir
- IEEE Transactions on Information Theory
- 2005

We define an ensemble of lattices, and show that for asymptotically high dimension most of its members are simultaneously good as sphere packings, sphere coverings, additive white Gaussian noiseâ€¦ (More)

- Simon Litsyn, Vladimir Shevelev
- IEEE Trans. Information Theory
- 2002

We derive expressions for the average distance distributions in several ensembles of regular low-density parity-check codes (LDPC). Among these ensembles are the standard one defined by matricesâ€¦ (More)

- Simon Litsyn
- 2007

The implementation of multicarrier (MC) modulation in wireless and wireline communication systems, such as OFDM and DMT, is restricted by peak signal power, due to a sensitivity of the technique toâ€¦ (More)

- Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
- IEEE Transactions on Information Theory
- 2005

A code is locally testable if there is a way to indicate with high probability that a vector is far enough from any codeword by accessing only a very small number of the vector's bits. We show thatâ€¦ (More)

- Yael Ben-Haim, Simon Litsyn
- SIAM J. Discrete Math.
- 2005

Exact Minimum Density of Codes Identifying Vertices in the Square Grid Yael Ben-Haim and Simon Litsyn School of Electrical Engineering Tel-Aviv University Tel-Aviv 69978 Israel An identifying codeCâ€¦ (More)

- Eran Sharon, Simon Litsyn, Jacob Goldberger
- 2004 23rd IEEE Convention of Electrical andâ€¦
- 2004

An efficient decoding schedule for low-density parity-check (LDPC) codes that outperforms the conventional approach, in terms of both complexity and performance, is presented. Conventionally, in eachâ€¦ (More)

- Alexei E. Ashikhmin, Simon Litsyn
- IEEE Transactions on Information Theory
- 2004

A maximum a posteriori (MAP) probability decoder of a block code minimizes the probability of error for each transmitted symbol separately. The standard way of implementing MAP decoding of a linearâ€¦ (More)

- Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
- RANDOM-APPROX
- 2003

We describe an efficient randomized algorithm to test if a giv enbinary function f : f0; 1gn ! f0; 1g is a low-degree polynomial (that is, a sum of low-degree monomials). For a given integer k 1 andâ€¦ (More)

Using algebraic geometry codes we give a polynomial construction of quantum codes with asymptotically non-zero rate and relative distance.

- Eran Sharon, Simon Litsyn, Jacob Goldberger
- IEEE Transactions on Information Theory
- 2007

Conventionally, in each low-density parity-check (LDPC) decoding iteration all the variable nodes and subsequently all the check nodes send messages to their neighbors (flooding schedule). Anâ€¦ (More)