Simon Litsyn

Publication Activity (10 Years)

Years Active: 1986-2017
Publications (10 Years): 2

Top Venues

CoRR

IEEE Trans. Inf. Theory

IEEE J. Sel. Areas Commun.

Publications

Noam Presman, Simon Litsyn
Recursive descriptions of polar codes. Adv. Math. Commun. 11 (1) (2017)
Noam Presman, Ofer Shapira, Simon Litsyn
Mixed-Kernels Constructions of Polar Codes. IEEE J. Sel. Areas Commun. 34 (2) (2016)
Noam Presman, Ofer Shapira, Simon Litsyn, Tuvi Etzion, Alexander Vardy
Binary Polarization Kernels From Code Decompositions. IEEE Trans. Inf. Theory 61 (5) (2015)
Noam Presman, Ofer Shapira, Simon Litsyn, Tuvi Etzion, Alexander Vardy
Binary Polarization Kernels from Code Decompositions. CoRR (2014)
Alex Bazarsky, Noam Presman, Simon Litsyn
Design of non-binary quasi-cyclic LDPC codes by ACE optimization. ITW (2013)
Gerhard Wunder, Robert F. H. Fischer, Holger Boche, Simon Litsyn, Jong-Seon No
The PAPR Problem in OFDM Transmission: New Directions for a Long-Lasting Problem. IEEE Signal Process. Mag. 30 (6) (2013)
Alex Bazarsky, Noam Presman, Simon Litsyn
Design of Non-Binary Quasi-Cyclic LDPC Codes by ACE Optimization CoRR (2013)
Gerhard Wunder, Robert F. H. Fischer, Holger Boche, Simon Litsyn, Jong-Seon No
The PAPR Problem in OFDM Transmission: New Directions for a Long-Lasting Problem CoRR (2012)
Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn
An Analytical Approach to the Calculation of EVM in Clipped Multi-Carrier Signals. IEEE Trans. Commun. 60 (5) (2012)
Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn
A Model for OFDM Signals with Applications. EW (2012)
Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn
A model for OFDM signals with applications. Trans. Emerg. Telecommun. Technol. 23 (8) (2012)
Noam Presman, Simon Litsyn
Recursive Descriptions of Decoding Algorithms and Hardware Architectures for Polar Codes CoRR (2012)
Noam Presman, Ofer Shapira, Simon Litsyn
Binary polar code kernels from code decompositions. ISIT (2011)
Noam Presman, Ofer Shapira, Simon Litsyn
Binary Polar Code Kernels from Code Decompositions CoRR (2011)
Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn
On the EVM of sequences. ISIT (2011)
Yuval Cassuto, Simon Litsyn
Symbol-pair codes: Algebraic constructions and asymptotic bounds. ISIT (2011)
Igal Kotzer, Simon Litsyn
On the EVM computation of arbitrary clipped multi-carrier signals. EURASIP J. Adv. Signal Process. 2011 (2011)
Noam Presman, Ofer Shapira, Simon Litsyn
Polar codes with mixed kernels. ISIT (2011)
Gerhard Wunder, Robert F. H. Fischer, Simon Litsyn, Jong-Seon No
Precoding and Transmitter-Side processing techniques for multiuser MIMO OFDM systems with special emphasis on the PAPR problem. EURASIP J. Adv. Signal Process. 2011 (2011)
Vladimir M. Blinovsky, Simon Litsyn
New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere. Discret. Comput. Geom. 46 (4) (2011)
Noam Presman, Ofer Shapira, Simon Litsyn
Polar Codes with Mixed Kernels CoRR (2011)
Tali Kaufman, Simon Litsyn, Ning Xie
Breaking the Epsilon-Soundness Bound of the Linearity Test over GF(2). SIAM J. Comput. 39 (5) (2010)
Vladimir M. Blinovsky, Uri Erez, Simon Litsyn
Weight distribution moments of random linear/coset codes. Des. Codes Cryptogr. 57 (2) (2010)
Noga Alon, Simon Litsyn, Alexander Shpunt
Typical peak sidelobe level of binary sequences. IEEE Trans. Inf. Theory 56 (1) (2010)
Eran Sharon, Noam Presman, Simon Litsyn
Analysis of LDPC decoding schedules. ISIT (2009)
Vladimir M. Blinovsky, Simon Litsyn
New asymptotic bounds on the size of list codes on Euclidean sphere. ISIT (2009)
Eran Sharon, Noam Presman, Simon Litsyn
Convergence analysis of generalized serial message-passing schedules. IEEE J. Sel. Areas Commun. 27 (6) (2009)
Eran Sharon, Omer Fainzilber, Simon Litsyn
Decreasing error floor in LDPC codes by parity-check matrix extensions. ISIT (2009)
Simon Litsyn, Alexander Shpunt
On the Distribution of Boolean Function Nonlinearity. SIAM J. Discret. Math. 23 (1) (2008)
Yael Ben-Haim, Simon Litsyn
Improved Upper Bounds on the Reliability Function of the Gaussian Channel. IEEE Trans. Inf. Theory 54 (1) (2008)
Eran Sharon, Simon Litsyn
Constructing LDPC codes by error minimization progressive edge growth. IEEE Trans. Commun. 56 (3) (2008)
Tali Kaufman, Simon Litsyn, Ning Xie
Breaking the ε-Soundness Bound of the Linearity Test over GF(2). Sublinear Algorithms (2008)
Christine Bachoc, Yael Ben-Haim, Simon Litsyn
Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds. IEEE Trans. Inf. Theory 54 (3) (2008)
Tali Kaufman, Simon Litsyn, Ning Xie
Breaking the epsilon-Soundness Bound of the Linearity Test over GF(2). APPROX-RANDOM (2008)
Noam Presman, Eran Sharon, Simon Litsyn
Efficient layers-based schedules for iterative decoding of LDPC codes. ISIT (2008)
Simon Litsyn, Alexander Shpunt
Typical peak sidelobe level of binary sequences. ISIT (2008)
Idan Alrod, Simon Litsyn, Alexander A. Yudin
On PMEPR of algebraic codes. Eur. Trans. Telecommun. 19 (7) (2008)
Christine Bachoc, Yael Ben-Haim, Simon Litsyn
Bounds for Codes in the Grassmann Manifold. ISIT (2007)
Tali Kaufman, Simon Litsyn, Ning Xie
Breaking the ε-Soundness Bound of the Linearity Test over GF(2). Electron. Colloquium Comput. Complex. 14 (098) (2007)
Yael Ben-Haim, Simon Litsyn
A new upper bound on the rate of non-binary codes. Adv. Math. Commun. 1 (1) (2007)
Beniamin Mounits, Tuvi Etzion, Simon Litsyn
New upper bounds on codes via association schemes and linear programming. Adv. Math. Commun. 1 (2) (2007)
Simon Litsyn, Beniamin Mounits
Improved lower bounds on sizes of single-error correcting codes. Des. Codes Cryptogr. 42 (1) (2007)
Eran Sharon, Simon Litsyn, Jacob Goldberger
Efficient Serial Message-Passing Schedules for LDPC Decoding. IEEE Trans. Inf. Theory 53 (11) (2007)
Shay Freundlich, David Burshtein, Simon Litsyn
Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity. IEEE Trans. Inf. Theory 53 (4) (2007)
Simon Litsyn, Alexander Shpunt
A Balancing Method for PMEPR Reduction in OFDM Signals. IEEE Trans. Commun. 55 (4) (2007)
Daniel Levin, Eran Sharon, Simon Litsyn
Lazy scheduling forLDPC decoding. IEEE Commun. Lett. 11 (1) (2007)
Idan Alrod, Simon Litsyn, Alexander A. Yudin
On the peak-to-average power ratio of M-sequences. Finite Fields Their Appl. 12 (1) (2006)
Yaniv Nana, Eran Sharon, Simon Litsyn
Improved decoding of LDPC coded modulations. IEEE Commun. Lett. 10 (5) (2006)
Shay Freundlich, David Burshtein, Simon Litsyn
Approximately Lower Triangular Ensembles of LPDC Codes with Linear Encoding Complexity. ISIT (2006)
Eran Sharon, Simon Litsyn
A Method for Constructing LDPC Codes with Low Error Floor. ISIT (2006)
Yael Ben-Haim, Simon Litsyn
A New Upper Bound on the Rate of Non-Binary Codes. ISIT (2006)
Yael Ben-Haim, Simon Litsyn
Upper bounds on the rate of LDPC codes as a function of minimum distance. IEEE Trans. Inf. Theory 52 (5) (2006)
Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn
Analysis of Low-Density Parity-Check Codes Based on EXIT Functions. IEEE Trans. Commun. 54 (7) (2006)
Shraga I. Bross, Simon Litsyn
Improved Upper Bounds for Codes With Unequal Error Protection. IEEE Trans. Inf. Theory 52 (7) (2006)
Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn
Analysis of low-density parity-check codes based on EXIT functions. IEEE Trans. Commun. 54 (8) (2006)
Simon Litsyn, Gerhard Wunder
Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design. IEEE Trans. Inf. Theory 52 (3) (2006)
Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn
EXIT Functions for Binary Input Memoryless Symmetric Channels. IEEE Trans. Commun. 54 (7) (2006)
Yael Ben-Haim, Simon Litsyn
Improved Upper Bounds on the Reliability Function of the Gaussian Channel. ISIT (2006)
Tali Kaufman, Simon Litsyn
Long Extended BCH Codes Are Spanned by Minimum Weight Words. AAECC (2006)
Beniamin Mounits, Tuvi Etzion, Simon Litsyn
New Upper Bounds on A(n,d) CoRR (2005)
Tali Kaufman, Simon Litsyn
Almost Orthogonal Linear Codes are Locally Testable. FOCS (2005)
Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
Testing Reed-Muller codes. IEEE Trans. Inf. Theory 51 (11) (2005)
Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
Bounds on distance distributions in codes of known size. IEEE Trans. Inf. Theory 51 (1) (2005)
Yael Ben-Haim, Simon Litsyn
Exact Minimum Density of Codes Identifying Vertices in the Square Grid. SIAM J. Discret. Math. 19 (1) (2005)
Simon Litsyn, Alexander A. Yudin
Discrete and continuous maxima in multicarrier communication. IEEE Trans. Inf. Theory 51 (3) (2005)
Yael Ben-Haim, Simon Litsyn
Upper bounds on the rate of LDPC codes as a function of minimum distance. ISIT (2005)
Uri Erez, Simon Litsyn, Ram Zamir
Lattices which are good for (almost) everything. IEEE Trans. Inf. Theory 51 (10) (2005)
Beniamin Mounits, Tuvi Etzion, Simon Litsyn
New upper bounds on A(n, d). ISIT (2005)
Shraga I. Bross, Simon Litsyn
Improved upper bounds for codes with unequal error protection. ISIT (2005)
Alexei E. Ashikhmin, Simon Litsyn
Simple MAP Decoding of First-Order Reed-Muller and Hamming Codes. IEEE Trans. Inf. Theory 50 (8) (2004)
Simon Litsyn, Gerhard Wunder
Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design. ISIT (2004)
Gregory Freiman, Simon Litsyn, Alexander A. Yudin
On signals with very high peak-to-average power ratio. ISIT (2004)
Gregory Freiman, Simon Litsyn, Alexander A. Yudin
A method to suppress high peaks in BPSK-modulated OFDM signal. IEEE Trans. Commun. 52 (9) (2004)
Alexei Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
Bounds on distance distributions in codes of known size. ISIT (2004)
Eran Sharon, Alexei Ashikhmin, Simon Litsyn
EXIT functions for binary memoryless symmetric channels. ISIT (2004)
Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
Generalized hashing and parent-identifying codes. J. Comb. Theory, Ser. A 104 (1) (2003)
Alexei Ashikhmin, Simon Litsyn
Simple MAP decoding of first order Reed-Muller and Hamming codes. ITW (2003)
Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori. Discret. Appl. Math. 129 (2-3) (2003)
Simon Litsyn, Alexander Shpunt
On the capacity of two-dimensional weight-constrained memories. Algebraic Coding Theory and Information Theory (2003)
Noga Alon, Simon Litsyn, Raphael Yuster
A Coding Theory Bound and Zero-Sum Square Matrices. Graphs Comb. 19 (4) (2003)
Gerhard Wunder, Simon Litsyn
On the statistical distribution of the crest-factor of codes in OFDM transmission. ITW (2003)
Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun
Intersecting Codes and Separating Codes. Discret. Appl. Math. 128 (1) (2003)
Simon Litsyn, Vladimir Shevelev
Distance distributions in ensembles of irregular low-density parity-check codes. IEEE Trans. Inf. Theory 49 (12) (2003)
Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
Testing Low-Degree Polynomials over GF(2(. RANDOM-APPROX (2003)
Uri Erez, Simon Litsyn, Ram Zamir
Lattices which are good for (almost) everything. ITW (2003)
Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun
Erratum to "Intersecting codes and separating codes": [Discrete Applied Mathematics 128 (2003) 75-83]. Discret. Appl. Math. 131 (3) (2003)
Simon Litsyn, Vladimir Shevelev
On ensembles of low-density parity-check codes: Asymptotic distance distributions. IEEE Trans. Inf. Theory 48 (4) (2002)
David Burshtein, Michael Krivelevich, Simon Litsyn, Gadi Miller
Upper bounds on the rate of LDPC Codes. IEEE Trans. Inf. Theory 48 (9) (2002)
Beniamin Mounits, Tuvi Etzion, Simon Litsyn
Improved upper bounds on sizes of codes. IEEE Trans. Inf. Theory 48 (4) (2002)
Iwan M. Duursma, Marcus Greferath, Simon Litsyn, Stefan E. Schmidt
, 24)-code. IEEE Trans. Inf. Theory 47 (4) (2001)
Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn
Estimates of the distance distribution of codes and designs. IEEE Trans. Inf. Theory 47 (3) (2001)
Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn
Intersecting codes and partially identifying codes. Electron. Notes Discret. Math. 6 (2001)
Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn
On the Identification of Vertices and Edges Using Cycles. AAECC (2001)
Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn
Estimates of the Distance Distribution of Codes and Designs. Electron. Notes Discret. Math. 6 (2001)
Uri Blass, Iiro S. Honkala, Simon Litsyn
Bounds on identifying codes. Discret. Math. 241 (1-3) (2001)
Ilia Krasikov, Simon Litsyn
On the Distance Distributions of BCH Codes and Their Duals. Des. Codes Cryptogr. 23 (2) (2001)
Gérard D. Cohen, Simon Litsyn, Gilles Zémor
Binary Codes for Collusion-Secure Fingerprinting. ICISC (2001)
Gérard D. Cohen, Simon Litsyn, Gilles Zémor
-Sequences : A New Upper Bound. J. Comb. Theory, Ser. A 94 (1) (2001)
Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn
A new upper bound on the reliability function of the Gaussian channel. IEEE Trans. Inf. Theory 46 (6) (2000)
Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn
Quantum error detection II: Bounds. IEEE Trans. Inf. Theory 46 (3) (2000)

Simon Litsyn.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Simon Litsyn