Simon Litsyn

According to our database1, Simon Litsyn authored at least 145 papers between 1986 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Recursive descriptions of polar codes.
Adv. Math. Commun., 2017

2016
Mixed-Kernels Constructions of Polar Codes.
IEEE J. Sel. Areas Commun., 2016

2015
Binary Polarization Kernels From Code Decompositions.
IEEE Trans. Inf. Theory, 2015

2013
The PAPR Problem in OFDM Transmission: New Directions for a Long-Lasting Problem.
IEEE Signal Process. Mag., 2013

Design of non-binary quasi-cyclic LDPC codes by ACE optimization.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Polar codes.
Proceedings of the Handbook of Finite Fields., 2013

2012
An Analytical Approach to the Calculation of EVM in Clipped Multi-Carrier Signals.
IEEE Trans. Commun., 2012

A model for OFDM signals with applications.
Trans. Emerg. Telecommun. Technol., 2012

Recursive Descriptions of Decoding Algorithms and Hardware Architectures for Polar Codes
CoRR, 2012

2011
Precoding and Transmitter-Side processing techniques for multiuser MIMO OFDM systems with special emphasis on the PAPR problem.
EURASIP J. Adv. Signal Process., 2011

On the EVM computation of arbitrary clipped multi-carrier signals.
EURASIP J. Adv. Signal Process., 2011

New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere.
Discret. Comput. Geom., 2011

Binary polar code kernels from code decompositions.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Polar codes with mixed kernels.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On the EVM of sequences.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Symbol-pair codes: Algebraic constructions and asymptotic bounds.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Typical peak sidelobe level of binary sequences.
IEEE Trans. Inf. Theory, 2010

Breaking the Epsilon-Soundness Bound of the Linearity Test over GF(2).
SIAM J. Comput., 2010

Weight distribution moments of random linear/coset codes.
Des. Codes Cryptogr., 2010

2009
Convergence analysis of generalized serial message-passing schedules.
IEEE J. Sel. Areas Commun., 2009

Analysis of LDPC decoding schedules.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Decreasing error floor in LDPC codes by parity-check matrix extensions.
Proceedings of the IEEE International Symposium on Information Theory, 2009

New asymptotic bounds on the size of list codes on Euclidean sphere.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Improved Upper Bounds on the Reliability Function of the Gaussian Channel.
IEEE Trans. Inf. Theory, 2008

Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds.
IEEE Trans. Inf. Theory, 2008

Constructing LDPC codes by error minimization progressive edge growth.
IEEE Trans. Commun., 2008

On the Distribution of Boolean Function Nonlinearity.
SIAM J. Discret. Math., 2008

On PMEPR of algebraic codes.
Eur. Trans. Telecommun., 2008

Efficient layers-based schedules for iterative decoding of LDPC codes.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Typical peak sidelobe level of binary sequences.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Efficient Serial Message-Passing Schedules for LDPC Decoding.
IEEE Trans. Inf. Theory, 2007

Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity.
IEEE Trans. Inf. Theory, 2007

A Balancing Method for PMEPR Reduction in OFDM Signals.
IEEE Trans. Commun., 2007

Lazy scheduling forLDPC decoding.
IEEE Commun. Lett., 2007

Breaking the ε-Soundness Bound of the Linearity Test over GF(2).
Electron. Colloquium Comput. Complex., 2007

Improved lower bounds on sizes of single-error correcting codes.
Des. Codes Cryptogr., 2007

New upper bounds on codes via association schemes and linear programming.
Adv. Math. Commun., 2007

A new upper bound on the rate of non-binary codes.
Adv. Math. Commun., 2007

Bounds for Codes in the Grassmann Manifold.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Peak power control in multicarrier communications.
Cambridge University Press, ISBN: 978-0-521-85596-9, 2007

2006
Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design.
IEEE Trans. Inf. Theory, 2006

Improved Upper Bounds for Codes With Unequal Error Protection.
IEEE Trans. Inf. Theory, 2006

Upper bounds on the rate of LDPC codes as a function of minimum distance.
IEEE Trans. Inf. Theory, 2006

Analysis of low-density parity-check codes based on EXIT functions.
IEEE Trans. Commun., 2006

EXIT Functions for Binary Input Memoryless Symmetric Channels.
IEEE Trans. Commun., 2006

Improved decoding of LDPC coded modulations.
IEEE Commun. Lett., 2006

On the peak-to-average power ratio of M-sequences.
Finite Fields Their Appl., 2006

A Method for Constructing LDPC Codes with Low Error Floor.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Approximately Lower Triangular Ensembles of LPDC Codes with Linear Encoding Complexity.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Long Extended BCH Codes Are Spanned by Minimum Weight Words.
Proceedings of the Applied Algebra, 2006

2005
Discrete and continuous maxima in multicarrier communication.
IEEE Trans. Inf. Theory, 2005

Lattices which are good for (almost) everything.
IEEE Trans. Inf. Theory, 2005

Bounds on distance distributions in codes of known size.
IEEE Trans. Inf. Theory, 2005

Testing Reed-Muller codes.
IEEE Trans. Inf. Theory, 2005

Exact Minimum Density of Codes Identifying Vertices in the Square Grid.
SIAM J. Discret. Math., 2005

New upper bounds on A(n, d).
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Almost Orthogonal Linear Codes are Locally Testable.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Covering Codes.
North-Holland mathematical library 54, North-Holland, ISBN: 978-0-444-82511-7, 2005

2004
Simple MAP Decoding of First-Order Reed-Muller and Hamming Codes.
IEEE Trans. Inf. Theory, 2004

A method to suppress high peaks in BPSK-modulated OFDM signal.
IEEE Trans. Commun., 2004

EXIT functions for binary memoryless symmetric channels.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On signals with very high peak-to-average power ratio.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Distance distributions in ensembles of irregular low-density parity-check codes.
IEEE Trans. Inf. Theory, 2003

Generalized hashing and parent-identifying codes.
J. Comb. Theory, Ser. A, 2003

A Coding Theory Bound and Zero-Sum Square Matrices.
Graphs Comb., 2003

Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori.
Discret. Appl. Math., 2003

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

Intersecting Codes and Separating Codes.
Discret. Appl. Math., 2003

Testing Low-Degree Polynomials over GF(2(.
Proceedings of the Approximation, 2003

On the statistical distribution of the crest-factor of codes in OFDM transmission.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

On the capacity of two-dimensional weight-constrained memories.
Proceedings of the Algebraic Coding Theory and Information Theory, 2003

2002
Improved upper bounds on sizes of codes.
IEEE Trans. Inf. Theory, 2002

On ensembles of low-density parity-check codes: Asymptotic distance distributions.
IEEE Trans. Inf. Theory, 2002

Upper bounds on the rate of LDPC Codes.
IEEE Trans. Inf. Theory, 2002

2001
A Z<sub>8</sub>-linear lift of the binary Golay code and a nonlinear Binary (96, 2<sup>37</sup>, 24)-code.
IEEE Trans. Inf. Theory, 2001

Binary B<sub>2</sub>-Sequences : A New Upper Bound.
J. Comb. Theory, Ser. A, 2001

Intersecting codes and partially identifying codes.
Electron. Notes Discret. Math., 2001

Estimates of the Distance Distribution of Codes and Designs.
Electron. Notes Discret. Math., 2001

Bounds on identifying codes.
Discret. Math., 2001

On the Distance Distributions of BCH Codes and Their Duals.
Des. Codes Cryptogr., 2001

Binary Codes for Collusion-Secure Fingerprinting.
Proceedings of the Information Security and Cryptology, 2001

On the Identification of Vertices and Edges Using Cycles.
Proceedings of the Applied Algebra, 2001

2000
An improved upper bound on the minimum distance of doubly-even self-dual codes.
IEEE Trans. Inf. Theory, 2000

A new upper bound on the reliability function of the Gaussian channel.
IEEE Trans. Inf. Theory, 2000

Quantum error detection II: Bounds.
IEEE Trans. Inf. Theory, 2000

Quantum error detection I: Statement of the problem.
IEEE Trans. Inf. Theory, 2000

1999
New Upper Bounds on Error Exponents.
IEEE Trans. Inf. Theory, 1999

On the Distance Distribution of Duals of BCH Codes.
IEEE Trans. Inf. Theory, 1999

More on the Distance Distribution of BCH Codes.
IEEE Trans. Inf. Theory, 1999

Asymptotically exact bounds on the size of high-order spectral-null codes.
IEEE Trans. Inf. Theory, 1999

On binary constructions of quantum codes.
IEEE Trans. Inf. Theory, 1999

Upper Bounds on the Size of Quantum Codes.
IEEE Trans. Inf. Theory, 1999

On relations between covering radius and dual distance.
IEEE Trans. Inf. Theory, 1999

New Upper Bounds on Generalized Weights.
IEEE Trans. Inf. Theory, 1999

New Bounds On Covering Radius as a Function of Dual Distance.
SIAM J. Discret. Math., 1999

Polynomial method in coding and information theory
CoRR, 1999

The smallest covering code of length 8 and radius 2 has 12 words.
Ars Comb., 1999

Survey of binary Krawtchouk polynomials.
Proceedings of the Codes and Association Schemes, 1999

Estimates of the distance distribution of nonbinary codes, with applications.
Proceedings of the Codes and Association Schemes, 1999

On tHe Size of Identifying Codes.
Proceedings of the Applied Algebra, 1999

1998
Codes Correcting Phased Burst Erasures.
IEEE Trans. Inf. Theory, 1998

Several New Lower Bounds on the Size of Codes with Covering Radius One.
IEEE Trans. Inf. Theory, 1998

On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes.
Des. Codes Cryptogr., 1998

Bounds on Spectra of Codes with Known Dual Distance.
Des. Codes Cryptogr., 1998

On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual Distance.
Discret. Appl. Math., 1998

Several new lower bounds for football pool systems.
Ars Comb., 1998

1997
Parameters of Goppa codes revisited.
IEEE Trans. Inf. Theory, 1997

Linear programming bounds for doubly-even self-dual codes.
IEEE Trans. Inf. Theory, 1997

Estimates for the range of binomiality in codes' spectra.
IEEE Trans. Inf. Theory, 1997

A class of array codes correcting multiple column erasures.
IEEE Trans. Inf. Theory, 1997

Long packing and covering codes.
IEEE Trans. Inf. Theory, 1997

Tiling Hamming Space with Few Spheres.
J. Comb. Theory, Ser. A, 1997

Linear Programming Bounds for Codes of Small Size.
Eur. J. Comb., 1997

On Covering Radius and Discrete Chebyshev Polynomials.
Appl. Algebra Eng. Commun. Comput., 1997

Covering Radius 1985-1994.
Appl. Algebra Eng. Commun. Comput., 1997

1996
More on the covering radius of BCH codes.
IEEE Trans. Inf. Theory, 1996

On greedy algorithms in coding theory.
IEEE Trans. Inf. Theory, 1996

On the traveling salesman problem in binary Hamming spaces.
IEEE Trans. Inf. Theory, 1996

Tilings of Binary Spaces.
SIAM J. Discret. Math., 1996

On Integral Zeros of Krawtchouk Polynomials.
J. Comb. Theory, Ser. A, 1996

Upper Bounds on the Covering Radius of a Code with a Given Dual Distance.
Eur. J. Comb., 1996

Fast Decoding Algorithms for First Order Reed-Muller and Related Codes.
Des. Codes Cryptogr., 1996

Fast decoding of non-binary first order Reed-Muller codes.
Appl. Algebra Eng. Commun. Comput., 1996

1995
On the accuracy of the binomial approximation to the distance distribution of codes.
IEEE Trans. Inf. Theory, 1995

On spectra of BCH codes.
IEEE Trans. Inf. Theory, 1995

Weighted coverings and packings.
IEEE Trans. Inf. Theory, 1995

Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points.
SIAM J. Discret. Math., 1995

Two New Bounds on the Size of Binary Codes with a Minimum Distance of Three.
Des. Codes Cryptogr., 1995

On the Covering Radius of Long Goppa Codes.
Proceedings of the Applied Algebra, 1995

On Algebraic Methods in Covering Radius Problems.
Proceedings of the Applied Algebra, 1995

1994
The uniqueness of the Best code.
IEEE Trans. Inf. Theory, 1994

Upper bounds on generalized distances.
IEEE Trans. Inf. Theory, 1994

Character Sum Constructions of Constrained Error-Correcting Codes.
Appl. Algebra Eng. Commun. Comput., 1994

Divisibility Properties and New Bounds for Cyclic Codes and Exponential Sums in One and Several Variables.
Appl. Algebra Eng. Commun. Comput., 1994

1993
Error-correcting codes with bounded running digital sum.
IEEE Trans. Inf. Theory, 1993

Bounds for Binary Multiple Covering Codes.
Des. Codes Cryptogr., 1993

Two new upper bounds for codes of distance 3.
Proceedings of the Algebraic Coding, 1993

1992
On the covering radius of Reed-Muller codes.
Discret. Math., 1992

1991
A note on perfect multiple covetings of the Hamming space.
IEEE Trans. Inf. Theory, 1991

DC-constrained error-correcting codes with small running digital sum.
IEEE Trans. Inf. Theory, 1991

DC-constrained codes from Hadamard matrices.
IEEE Trans. Inf. Theory, 1991

On Perfect Weighted Coverings with Small Radius.
Proceedings of the Algebraic Coding, 1991

A Fast Search for the Maximum Element of the Fourier Spectrum.
Proceedings of the Algebraic Coding, 1991

Fast Algorithms for Decoding Orthogonal and Related Codes.
Proceedings of the Applied Algebra, 1991

1986
A note on lower bounds.
IEEE Trans. Inf. Theory, 1986


  Loading...