A note on lower bounds. - Simon Litsyn; Michael A. Tsfasman (IEEE Trans. Inf. Theory, 1986)

Fast Algorithms for Decoding Orthogonal and Related Codes. - Simon Litsyn (AAECC, 1991)

A Fast Search for the Maximum Element of the Fourier Spectrum. - Alexei E. Ashikhmin; Simon Litsyn (Algebraic Coding, 1991)

On Perfect Weighted Coverings with Small Radius. - Gérard D. Cohen; Simon Litsyn; H. F. Mattson Jr. (Algebraic Coding, 1991)

DC-constrained codes from Hadamard matrices. - Alexander Barg; Simon Litsyn (IEEE Trans. Inf. Theory, 1991)

DC-constrained error-correcting codes with small running digital sum. - Gérard D. Cohen; Simon Litsyn (IEEE Trans. Inf. Theory, 1991)

A note on perfect multiple covetings of the Hamming space. - Gerhard J. M. van Wee; Gérard D. Cohen; Simon Litsyn (IEEE Trans. Inf. Theory, 1991)

On the covering radius of Reed-Muller codes. - Gérard D. Cohen; Simon Litsyn (Discret. Math., 1992)

Two new upper bounds for codes of distance 3. - Simon Litsyn; Alexander Vardy (Algebraic Coding, 1993)

Bounds for Binary Multiple Covering Codes. - Heikki O. Hämäläinen; Iiro S. Honkala; Markku K. Kaikkonen; Simon Litsyn (Des. Codes Cryptogr., 1993)

Error-correcting codes with bounded running digital sum. - Mario Blaum; Simon Litsyn; Vincent Buskens; Henk C. A. van Tilborg (IEEE Trans. Inf. Theory, 1993)

Divisibility Properties and New Bounds for Cyclic Codes and Exponential Sums in One and Several Variables. - Simon Litsyn; Oscar Moreno; Carlos J. Moreno (Appl. Algebra Eng. Commun. Comput., 1994)

Character Sum Constructions of Constrained Error-Correcting Codes. - Simon Litsyn; Aimo Tietäväinen (Appl. Algebra Eng. Commun. Comput., 1994)

Upper bounds on generalized distances. - Gérard D. Cohen; Simon Litsyn; Gilles Zémor (IEEE Trans. Inf. Theory, 1994)

The uniqueness of the Best code. - Simon Litsyn; Alexander Vardy (IEEE Trans. Inf. Theory, 1994)

On Algebraic Methods in Covering Radius Problems. - Iiro S. Honkala; Simon Litsyn; Aimo Tietäväinen (AAECC, 1995)

On the Covering Radius of Long Goppa Codes. - Françoise Levy-dit-Vehel; Simon Litsyn (AAECC, 1995)

Two New Bounds on the Size of Binary Codes with a Minimum Distance of Three. - Yaron Klein; Simon Litsyn; Alexander Vardy (Des. Codes Cryptogr., 1995)

Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points. - Heikki O. Hämäläinen; Iiro S. Honkala; Simon Litsyn; Patric R. J. Östergård (SIAM J. Discret. Math., 1995)

Weighted coverings and packings. - Gérard D. Cohen; Iiro S. Honkala; Simon Litsyn; H. F. Mattson Jr. (IEEE Trans. Inf. Theory, 1995)

On spectra of BCH codes. - Ilia Krasikov; Simon Litsyn (IEEE Trans. Inf. Theory, 1995)

On the accuracy of the binomial approximation to the distance distribution of codes. - Ilia Krasikov; Simon Litsyn (IEEE Trans. Inf. Theory, 1995)

Fast decoding of non-binary first order Reed-Muller codes. - Alexei E. Ashikhmin; Simon Litsyn (Appl. Algebra Eng. Commun. Comput., 1996)

Fast Decoding Algorithms for First Order Reed-Muller and Related Codes. - Alexei E. Ashikhmin; Simon Litsyn (Des. Codes Cryptogr., 1996)

Upper Bounds on the Covering Radius of a Code with a Given Dual Distance. - Simon Litsyn; Aimo Tietäväinen (Eur. J. Comb., 1996)

On Integral Zeros of Krawtchouk Polynomials. - Ilia Krasikov; Simon Litsyn (J. Comb. Theory A, 1996)

Tilings of Binary Spaces. - Gérard D. Cohen; Simon Litsyn; Alexander Vardy; Gilles Zémor (SIAM J. Discret. Math., 1996)

On the traveling salesman problem in binary Hamming spaces. - Gérard D. Cohen; Simon Litsyn; Gilles Zémor (IEEE Trans. Inf. Theory, 1996)

On greedy algorithms in coding theory. - Gérard D. Cohen; Simon Litsyn; Gilles Zémor (IEEE Trans. Inf. Theory, 1996)

More on the covering radius of BCH codes. - Françoise Levy-dit-Vehel; Simon Litsyn (IEEE Trans. Inf. Theory, 1996)

Covering Radius 1985-1994. - Gérard D. Cohen; Simon Litsyn; Antoine Lobstein; H. F. Mattson Jr. (Appl. Algebra Eng. Commun. Comput., 1997)

On Covering Radius and Discrete Chebyshev Polynomials. - Iiro S. Honkala; Tero Laihonen; Simon Litsyn (Appl. Algebra Eng. Commun. Comput., 1997)

Linear Programming Bounds for Codes of Small Size. - Ilia Krasikov; Simon Litsyn (Eur. J. Comb., 1997)

Tiling Hamming Space with Few Spheres. - Henk D. L. Hollmann; János Körner; Simon Litsyn (J. Comb. Theory A, 1997)

Long packing and covering codes. - Gérard D. Cohen; Iiro S. Honkala; Simon Litsyn; Patrick Solé (IEEE Trans. Inf. Theory, 1997)

A class of array codes correcting multiple column erasures. - Osnat Keren; Simon Litsyn (IEEE Trans. Inf. Theory, 1997)

Estimates for the range of binomiality in codes' spectra. - Ilia Krasikov; Simon Litsyn (IEEE Trans. Inf. Theory, 1997)

Linear programming bounds for doubly-even self-dual codes. - Ilia Krasikov; Simon Litsyn (IEEE Trans. Inf. Theory, 1997)

Parameters of Goppa codes revisited. - Françoise Levy-dit-Vehel; Simon Litsyn (IEEE Trans. Inf. Theory, 1997)

Several new lower bounds for football pool systems. - Uri Blass; Simon Litsyn (Ars Comb., 1998)

On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual Distance. - Simon Litsyn; Patrick Solé; René Struik (Discret. Appl. Math., 1998)

Bounds on Spectra of Codes with Known Dual Distance. - Ilia Krasikov; Simon Litsyn (Des. Codes Cryptogr., 1998)

On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes. - Tero Laihonen; Simon Litsyn (Des. Codes Cryptogr., 1998)

Several New Lower Bounds on the Size of Codes with Covering Radius One. - Uri Blass; Simon Litsyn (IEEE Trans. Inf. Theory, 1998)

Codes Correcting Phased Burst Erasures. - Osnat Keren; Simon Litsyn (IEEE Trans. Inf. Theory, 1998)

On tHe Size of Identifying Codes. - Uri Blass; Iiro S. Honkala; Simon Litsyn (AAECC, 1999)

Estimates of the distance distribution of nonbinary codes, with applications. - Alexei E. Ashikhmin; Alexander Barg; Simon Litsyn (Codes and Association Schemes, 1999)

Survey of binary Krawtchouk polynomials. - Ilia Krasikov; Simon Litsyn (Codes and Association Schemes, 1999)

The smallest covering code of length 8 and radius 2 has 12 words. - Uri Blass; Simon Litsyn (Ars Comb., 1999)

Polynomial method in coding and information theory - Alexei E. Ashikhmin; Alexander Barg; Simon Litsyn (CoRR, 1999)

New Bounds On Covering Radius as a Function of Dual Distance. - Tero Laihonen; Simon Litsyn (SIAM J. Discret. Math., 1999)

New Upper Bounds on Generalized Weights. - Alexei E. Ashikhmin; Alexander Barg; Simon Litsyn (IEEE Trans. Inf. Theory, 1999)

On relations between covering radius and dual distance. - Alexei E. Ashikhmin; Iiro S. Honkala; Tero Laihonen; Simon Litsyn (IEEE Trans. Inf. Theory, 1999)

Upper Bounds on the Size of Quantum Codes. - Alexei E. Ashikhmin; Simon Litsyn (IEEE Trans. Inf. Theory, 1999)

On binary constructions of quantum codes. - Gérard D. Cohen; Sylvia B. Encheva; Simon Litsyn (IEEE Trans. Inf. Theory, 1999)

Asymptotically exact bounds on the size of high-order spectral-null codes. - Gregory Freiman; Simon Litsyn (IEEE Trans. Inf. Theory, 1999)

More on the Distance Distribution of BCH Codes. - Osnat Keren; Simon Litsyn (IEEE Trans. Inf. Theory, 1999)

On the Distance Distribution of Duals of BCH Codes. - Ilia Krasikov; Simon Litsyn (IEEE Trans. Inf. Theory, 1999)

New Upper Bounds on Error Exponents. - Simon Litsyn (IEEE Trans. Inf. Theory, 1999)

Quantum error detection I: Statement of the problem. - Alexei E. Ashikhmin; Alexander Barg; Emanuel Knill; Simon Litsyn (IEEE Trans. Inf. Theory, 2000)

Quantum error detection II: Bounds. - Alexei E. Ashikhmin; Alexander Barg; Emanuel Knill; Simon Litsyn (IEEE Trans. Inf. Theory, 2000)

A new upper bound on the reliability function of the Gaussian channel. - Alexei E. Ashikhmin; Alexander Barg; Simon Litsyn (IEEE Trans. Inf. Theory, 2000)

An improved upper bound on the minimum distance of doubly-even self-dual codes. - Ilia Krasikov; Simon Litsyn (IEEE Trans. Inf. Theory, 2000)

On the Identification of Vertices and Edges Using Cycles. - Iiro S. Honkala; Mark G. Karpovsky; Simon Litsyn (AAECC, 2001)

Binary Codes for Collusion-Secure Fingerprinting. - Gérard D. Cohen; Simon Litsyn; Gilles Zémor (ICISC, 2001)

On the Distance Distributions of BCH Codes and Their Duals. - Ilia Krasikov; Simon Litsyn (Des. Codes Cryptogr., 2001)

Bounds on identifying codes. - Uri Blass; Iiro S. Honkala; Simon Litsyn (Discret. Math., 2001)

Estimates of the Distance Distribution of Codes and Designs. - Alexei E. Ashikhmin; Alexander Barg; Simon Litsyn (Electron. Notes Discret. Math., 2001)

Intersecting codes and partially identifying codes. - Gérard D. Cohen; Sylvia B. Encheva; Simon Litsyn (Electron. Notes Discret. Math., 2001)

Binary B2-Sequences : A New Upper Bound. - Gérard D. Cohen; Simon Litsyn; Gilles Zémor (J. Comb. Theory A, 2001)

A Z8-linear lift of the binary Golay code and a nonlinear Binary (96, 237, 24)-code. - Iwan M. Duursma; Marcus Greferath; Simon Litsyn; Stefan E. Schmidt (IEEE Trans. Inf. Theory, 2001)

Upper bounds on the rate of LDPC Codes. - David Burshtein; Michael Krivelevich; Simon Litsyn; Gadi Miller (IEEE Trans. Inf. Theory, 2002)

On ensembles of low-density parity-check codes: Asymptotic distance distributions. - Simon Litsyn; Vladimir Shevelev (IEEE Trans. Inf. Theory, 2002)

Improved upper bounds on sizes of codes. - Beniamin Mounits; Tuvi Etzion; Simon Litsyn (IEEE Trans. Inf. Theory, 2002)

On the capacity of two-dimensional weight-constrained memories. - Simon Litsyn; Alexander Shpunt (Algebraic Coding Theory and Information Theory, 2003)

On the statistical distribution of the crest-factor of codes in OFDM transmission. - Gerhard Wunder; Simon Litsyn (ITW, 2003)

Testing Low-Degree Polynomials over GF(2(. - Noga Alon; Tali Kaufman; Michael Krivelevich; Simon Litsyn; Dana Ron (RANDOM-APPROX, 2003)

Intersecting Codes and Separating Codes. - Gérard D. Cohen; Sylvia B. Encheva; Simon Litsyn; Hans Georg Schaathun (Discret. Appl. Math., 2003)

Erratum to "Intersecting codes and separating codes": [Discrete Applied Mathematics 128 (2003) 75-83]. - Gérard D. Cohen; Sylvia B. Encheva; Simon Litsyn; Hans Georg Schaathun (Discret. Appl. Math., 2003)

Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori. - Iiro S. Honkala; Mark G. Karpovsky; Simon Litsyn (Discret. Appl. Math., 2003)

A Coding Theory Bound and Zero-Sum Square Matrices. - Noga Alon; Simon Litsyn; Raphael Yuster (Graphs Comb., 2003)

Generalized hashing and parent-identifying codes. - Noga Alon; Gérard D. Cohen; Michael Krivelevich; Simon Litsyn (J. Comb. Theory A, 2003)

Distance distributions in ensembles of irregular low-density parity-check codes. - Simon Litsyn; Vladimir Shevelev (IEEE Trans. Inf. Theory, 2003)

On signals with very high peak-to-average power ratio. - Gregory Freiman; Simon Litsyn; Alexander A. Yudin (ISIT, 2004)

EXIT functions for binary memoryless symmetric channels. - Eran Sharon; Alexei Ashikhmin; Simon Litsyn (ISIT, 2004)

A method to suppress high peaks in BPSK-modulated OFDM signal. - Gregory Freiman; Simon Litsyn; Alexander A. Yudin (IEEE Trans. Commun., 2004)

Simple MAP Decoding of First-Order Reed-Muller and Hamming Codes. - Alexei E. Ashikhmin; Simon Litsyn (IEEE Trans. Inf. Theory, 2004)

Covering Codes. - Gérard D. Cohen; Iiro S. Honkala; Simon Litsyn; Antoine Lobstein (North-Holland, 2005)

Almost Orthogonal Linear Codes are Locally Testable. - Tali Kaufman; Simon Litsyn (FOCS, 2005)

New upper bounds on A(n, d). - Beniamin Mounits; Tuvi Etzion; Simon Litsyn (ISIT, 2005)

Exact Minimum Density of Codes Identifying Vertices in the Square Grid. - Yael Ben-Haim; Simon Litsyn (SIAM J. Discret. Math., 2005)

Testing Reed-Muller codes. - Noga Alon; Tali Kaufman; Michael Krivelevich; Simon Litsyn; Dana Ron (IEEE Trans. Inf. Theory, 2005)

Bounds on distance distributions in codes of known size. - Alexei E. Ashikhmin; Gérard D. Cohen; Michael Krivelevich; Simon Litsyn (IEEE Trans. Inf. Theory, 2005)

Lattices which are good for (almost) everything. - Uri Erez; Simon Litsyn; Ram Zamir (IEEE Trans. Inf. Theory, 2005)

Discrete and continuous maxima in multicarrier communication. - Simon Litsyn; Alexander A. Yudin (IEEE Trans. Inf. Theory, 2005)

Long Extended BCH Codes Are Spanned by Minimum Weight Words. - Tali Kaufman; Simon Litsyn (AAECC, 2006)

Approximately Lower Triangular Ensembles of LPDC Codes with Linear Encoding Complexity. - Shay Freundlich; David Burshtein; Simon Litsyn (ISIT, 2006)

A Method for Constructing LDPC Codes with Low Error Floor. - Eran Sharon; Simon Litsyn (ISIT, 2006)

On the peak-to-average power ratio of M-sequences. - Idan Alrod; Simon Litsyn; Alexander A. Yudin (Finite Fields Their Appl., 2006)

Improved decoding of LDPC coded modulations. - Yaniv Nana; Eran Sharon; Simon Litsyn (IEEE Commun. Lett., 2006)

EXIT Functions for Binary Input Memoryless Symmetric Channels. - Eran Sharon; Alexei E. Ashikhmin; Simon Litsyn (IEEE Trans. Commun., 2006)

Analysis of low-density parity-check codes based on EXIT functions. - Eran Sharon; Alexei E. Ashikhmin; Simon Litsyn (IEEE Trans. Commun., 2006)

Upper bounds on the rate of LDPC codes as a function of minimum distance. - Yael Ben-Haim; Simon Litsyn (IEEE Trans. Inf. Theory, 2006)

Improved Upper Bounds for Codes With Unequal Error Protection. - Shraga I. Bross; Simon Litsyn (IEEE Trans. Inf. Theory, 2006)

Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design. - Simon Litsyn; Gerhard Wunder (IEEE Trans. Inf. Theory, 2006)

Peak power control in multicarrier communications. - Simon Litsyn (Cambridge University Press, 2007)

Bounds for Codes in the Grassmann Manifold. - Christine Bachoc; Yael Ben-Haim; Simon Litsyn (ISIT, 2007)

A new upper bound on the rate of non-binary codes. - Yael Ben-Haim; Simon Litsyn (Adv. Math. Commun., 2007)

New upper bounds on codes via association schemes and linear programming. - Beniamin Mounits; Tuvi Etzion; Simon Litsyn (Adv. Math. Commun., 2007)

Improved lower bounds on sizes of single-error correcting codes. - Simon Litsyn; Beniamin Mounits (Des. Codes Cryptogr., 2007)

Breaking the ε-Soundness Bound of the Linearity Test over GF(2). - Tali Kaufman; Simon Litsyn; Ning Xie 002 (Electron. Colloquium Comput. Complex., 2007)

Lazy scheduling forLDPC decoding. - Daniel Levin; Eran Sharon; Simon Litsyn (IEEE Commun. Lett., 2007)

A Balancing Method for PMEPR Reduction in OFDM Signals. - Simon Litsyn; Alexander Shpunt (IEEE Trans. Commun., 2007)

Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity. - Shay Freundlich; David Burshtein; Simon Litsyn (IEEE Trans. Inf. Theory, 2007)

Efficient Serial Message-Passing Schedules for LDPC Decoding. - Eran Sharon; Simon Litsyn; Jacob Goldberger (IEEE Trans. Inf. Theory, 2007)

Typical peak sidelobe level of binary sequences. - Simon Litsyn; Alexander Shpunt (ISIT, 2008)

Efficient layers-based schedules for iterative decoding of LDPC codes. - Noam Presman; Eran Sharon; Simon Litsyn (ISIT, 2008)

On PMEPR of algebraic codes. - Idan Alrod; Simon Litsyn; Alexander A. Yudin (Eur. Trans. Telecommun., 2008)

On the Distribution of Boolean Function Nonlinearity. - Simon Litsyn; Alexander Shpunt (SIAM J. Discret. Math., 2008)

Constructing LDPC codes by error minimization progressive edge growth. - Eran Sharon; Simon Litsyn (IEEE Trans. Commun., 2008)

Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds. - Christine Bachoc; Yael Ben-Haim; Simon Litsyn (IEEE Trans. Inf. Theory, 2008)

Improved Upper Bounds on the Reliability Function of the Gaussian Channel. - Yael Ben-Haim; Simon Litsyn (IEEE Trans. Inf. Theory, 2008)

New asymptotic bounds on the size of list codes on Euclidean sphere. - Vladimir M. Blinovsky; Simon Litsyn (ISIT, 2009)

Decreasing error floor in LDPC codes by parity-check matrix extensions. - Eran Sharon; Omer Fainzilber; Simon Litsyn (ISIT, 2009)

Analysis of LDPC decoding schedules. - Eran Sharon; Noam Presman; Simon Litsyn (ISIT, 2009)

Convergence analysis of generalized serial message-passing schedules. - Eran Sharon; Noam Presman; Simon Litsyn (IEEE J. Sel. Areas Commun., 2009)

Weight distribution moments of random linear/coset codes. - Vladimir M. Blinovsky; Uri Erez; Simon Litsyn (Des. Codes Cryptogr., 2010)

Breaking the Epsilon-Soundness Bound of the Linearity Test over GF(2). - Tali Kaufman; Simon Litsyn; Ning Xie 002 (SIAM J. Comput., 2010)

Typical peak sidelobe level of binary sequences. - Noga Alon; Simon Litsyn; Alexander Shpunt (IEEE Trans. Inf. Theory, 2010)

Symbol-pair codes: Algebraic constructions and asymptotic bounds. - Yuval Cassuto; Simon Litsyn (ISIT, 2011)

On the EVM of sequences. - Igal Kotzer; Smadar Har-Nevo; Sasha Sodin; Simon Litsyn (ISIT, 2011)

Polar codes with mixed kernels. - Noam Presman; Ofer Shapira; Simon Litsyn (ISIT, 2011)

Binary polar code kernels from code decompositions. - Noam Presman; Ofer Shapira; Simon Litsyn (ISIT, 2011)

New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere. - Vladimir M. Blinovsky; Simon Litsyn (Discret. Comput. Geom., 2011)

On the EVM computation of arbitrary clipped multi-carrier signals. - Igal Kotzer; Simon Litsyn (EURASIP J. Adv. Signal Process., 2011)

Precoding and Transmitter-Side processing techniques for multiuser MIMO OFDM systems with special emphasis on the PAPR problem. - Gerhard Wunder; Robert F. H. Fischer; Simon Litsyn; Jong-Seon No (EURASIP J. Adv. Signal Process., 2011)

Recursive Descriptions of Decoding Algorithms and Hardware Architectures for Polar Codes - Noam Presman; Simon Litsyn (CoRR, 2012)

A model for OFDM signals with applications. - Igal Kotzer; Smadar Har-Nevo; Sasha Sodin; Simon Litsyn (Trans. Emerg. Telecommun. Technol., 2012)

An Analytical Approach to the Calculation of EVM in Clipped Multi-Carrier Signals. - Igal Kotzer; Smadar Har-Nevo; Sasha Sodin; Simon Litsyn (IEEE Trans. Commun., 2012)

Polar codes. - Simon Litsyn (Handbook of Finite Fields, 2013)

Design of non-binary quasi-cyclic LDPC codes by ACE optimization. - Alex Bazarsky; Noam Presman; Simon Litsyn (ITW, 2013)

The PAPR Problem in OFDM Transmission: New Directions for a Long-Lasting Problem. - Gerhard Wunder; Robert F. H. Fischer; Holger Boche; Simon Litsyn; Jong-Seon No (IEEE Signal Process. Mag., 2013)

Binary Polarization Kernels From Code Decompositions. - Noam Presman; Ofer Shapira; Simon Litsyn; Tuvi Etzion; Alexander Vardy (IEEE Trans. Inf. Theory, 2015)

Mixed-Kernels Constructions of Polar Codes. - Noam Presman; Ofer Shapira; Simon Litsyn (IEEE J. Sel. Areas Commun., 2016)

Recursive descriptions of polar codes. - Noam Presman; Simon Litsyn (Adv. Math. Commun., 2017)