Skip to content

Simon Litsyn

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

27

Venues

4

Active years

2001–2013

Best venue rank

A*

Where they publish

Papers

27 indexed papers, newest first.

YearVenueTitleAuthors
2013ITWDesign of non-binary quasi-cyclic LDPC codes by ACE optimization.Alex Bazarsky, Noam Presman, Simon Litsyn
2011ISITSymbol-pair codes: Algebraic constructions and asymptotic bounds.Yuval Cassuto, Simon Litsyn
2011ISITOn the EVM of sequences.Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn
2011ISITPolar codes with mixed kernels.Noam Presman, Ofer Shapira, Simon Litsyn
2011ISITBinary polar code kernels from code decompositions.Noam Presman, Ofer Shapira, Simon Litsyn
2009ISITNew asymptotic bounds on the size of list codes on Euclidean sphere.Vladimir M. Blinovsky, Simon Litsyn
2009ISITDecreasing error floor in LDPC codes by parity-check matrix extensions.Eran Sharon, Omer Fainzilber, Simon Litsyn
2009ISITAnalysis of LDPC decoding schedules.Eran Sharon, Noam Presman, Simon Litsyn
2008ISITTypical peak sidelobe level of binary sequences.Simon Litsyn, Alexander Shpunt
2008ISITEfficient layers-based schedules for iterative decoding of LDPC codes.Noam Presman, Eran Sharon, Simon Litsyn
2007ISITBounds for Codes in the Grassmann Manifold.Christine Bachoc, Yael Ben-Haim, Simon Litsyn
2006ISITA New Upper Bound on the Rate of Non-Binary Codes.Yael Ben-Haim, Simon Litsyn
2006ISITImproved Upper Bounds on the Reliability Function of the Gaussian Channel.Yael Ben-Haim, Simon Litsyn
2006ISITApproximately Lower Triangular Ensembles of LPDC Codes with Linear Encoding Complexity.Shay Freundlich, David Burshtein, Simon Litsyn
2006ISITA Method for Constructing LDPC Codes with Low Error Floor.Eran Sharon, Simon Litsyn
2005FOCSAlmost Orthogonal Linear Codes are Locally Testable.Tali Kaufman, Simon Litsyn
2005ISITUpper bounds on the rate of LDPC codes as a function of minimum distance.Yael Ben-Haim, Simon Litsyn
2005ISITImproved upper bounds for codes with unequal error protection.Shraga I. Bross, Simon Litsyn
2005ISITNew upper bounds on A(n, d).Beniamin Mounits, Tuvi Etzion, Simon Litsyn
2004ISITBounds on distance distributions in codes of known size.Alexei Ashikhmin, Grard D. Cohen, Michael Krivelevich, Simon Litsyn
2004ISITOn signals with very high peak-to-average power ratio.Gregory Freiman, Simon Litsyn, Alexander A. Yudin
2004ISITGeneralized bounds on the crest-factor distribution of OFDM signals with applications to code design.Simon Litsyn, Gerhard Wunder
2004ISITEXIT functions for binary memoryless symmetric channels.Eran Sharon, Alexei Ashikhmin, Simon Litsyn
2003ITWSimple MAP decoding of first order Reed-Muller and Hamming codes.Alexei Ashikhmin, Simon Litsyn
2003ITWLattices which are good for (almost) everything.Uri Erez, Simon Litsyn, Ram Zamir
2003ITWOn the statistical distribution of the crest-factor of codes in OFDM transmission.Gerhard Wunder, Simon Litsyn
2001ICISCBinary Codes for Collusion-Secure Fingerprinting.Grard D. Cohen, Simon Litsyn, Gilles Zmor