Simon Litsyn

167 papers A* 1B 25Misc 1Journal 118Unranked 16
YearRankTypeTitle / Venue / Authors
2017 J jnl
Recursive descriptions of polar codes.
Adv. Math. Commun.
Noam Presman, Simon Litsyn
2016 J jnl
Mixed-Kernels Constructions of Polar Codes.
IEEE J. Sel. Areas Commun.
Noam Presman, Ofer Shapira, Simon Litsyn
2015 J jnl
Binary Polarization Kernels From Code Decompositions.
IEEE Trans. Inf. Theory
Noam Presman, Ofer Shapira, Simon Litsyn, Tuvi Etzion, Alexander Vardy
2014 J jnl
Binary Polarization Kernels from Code Decompositions.
CoRR
Noam Presman, Ofer Shapira, Simon Litsyn, Tuvi Etzion, Alexander Vardy
2013 J jnl
Design of Non-Binary Quasi-Cyclic LDPC Codes by ACE Optimization
CoRR
Alex Bazarsky, Noam Presman, Simon Litsyn
2013 B conf
Design of non-binary quasi-cyclic LDPC codes by ACE optimization.
ITW
Alex Bazarsky, Noam Presman, Simon Litsyn
2013 — ch.
Polar codes.
Handbook of Finite Fields
Simon Litsyn
2013 J jnl
The PAPR Problem in OFDM Transmission: New Directions for a Long-Lasting Problem.
IEEE Signal Process. Mag.
Gerhard Wunder, Robert F. H. Fischer, Holger Boche, Simon Litsyn, Jong-Seon No
2012 — conf
A Model for OFDM Signals with Applications.
EW
Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn
2012 J jnl
A model for OFDM signals with applications.
Trans. Emerg. Telecommun. Technol.
Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn
2012 J jnl
An Analytical Approach to the Calculation of EVM in Clipped Multi-Carrier Signals.
IEEE Trans. Commun.
Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn
2012 J jnl
Recursive Descriptions of Decoding Algorithms and Hardware Architectures for Polar Codes
CoRR
Noam Presman, Simon Litsyn
2012 J jnl
The PAPR Problem in OFDM Transmission: New Directions for a Long-Lasting Problem
CoRR
Gerhard Wunder, Robert F. H. Fischer, Holger Boche, Simon Litsyn, Jong-Seon No
2011 J jnl
Binary Polar Code Kernels from Code Decompositions
CoRR
Noam Presman, Ofer Shapira, Simon Litsyn
2011 B conf
Binary polar code kernels from code decompositions.
ISIT
Noam Presman, Ofer Shapira, Simon Litsyn
2011 J jnl
New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere.
Discret. Comput. Geom.
Vladimir M. Blinovsky, Simon Litsyn
2011 J jnl
On the EVM computation of arbitrary clipped multi-carrier signals.
EURASIP J. Adv. Signal Process.
Igal Kotzer, Simon Litsyn
2011 B conf
On the EVM of sequences.
ISIT
Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn
2011 J jnl
Polar Codes with Mixed Kernels
CoRR
Noam Presman, Ofer Shapira, Simon Litsyn
2011 B conf
Polar codes with mixed kernels.
ISIT
Noam Presman, Ofer Shapira, Simon Litsyn
2011 J jnl
Precoding and Transmitter-Side processing techniques for multiuser MIMO OFDM systems with special emphasis on the PAPR problem.
EURASIP J. Adv. Signal Process.
Gerhard Wunder, Robert F. H. Fischer, Simon Litsyn, Jong-Seon No
2011 B conf
Symbol-pair codes: Algebraic constructions and asymptotic bounds.
ISIT
Yuval Cassuto, Simon Litsyn
2010 J jnl
Breaking the Epsilon-Soundness Bound of the Linearity Test over GF(2).
SIAM J. Comput.
Tali Kaufman, Simon Litsyn, Ning Xie
2010 J jnl
Typical peak sidelobe level of binary sequences.
IEEE Trans. Inf. Theory
Noga Alon, Simon Litsyn, Alexander Shpunt
2010 J jnl
Weight distribution moments of random linear/coset codes.
Des. Codes Cryptogr.
Vladimir M. Blinovsky, Uri Erez, Simon Litsyn
2009 B conf
Analysis of LDPC decoding schedules.
ISIT
Eran Sharon, Noam Presman, Simon Litsyn
2009 J jnl
Convergence analysis of generalized serial message-passing schedules.
IEEE J. Sel. Areas Commun.
Eran Sharon, Noam Presman, Simon Litsyn
2009 B conf
Decreasing error floor in LDPC codes by parity-check matrix extensions.
ISIT
Eran Sharon, Omer Fainzilber, Simon Litsyn
2009 B conf
New asymptotic bounds on the size of list codes on Euclidean sphere.
ISIT
Vladimir M. Blinovsky, Simon Litsyn
2008 J jnl
Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds.
IEEE Trans. Inf. Theory
Christine Bachoc, Yael Ben-Haim, Simon Litsyn
2008 — conf
Breaking the epsilon-Soundness Bound of the Linearity Test over GF(2).
APPROX-RANDOM
Tali Kaufman, Simon Litsyn, Ning Xie
2008 — conf
Breaking the ε-Soundness Bound of the Linearity Test over GF(2).
Sublinear Algorithms
Tali Kaufman, Simon Litsyn, Ning Xie
2008 J jnl
Constructing LDPC codes by error minimization progressive edge growth.
IEEE Trans. Commun.
Eran Sharon, Simon Litsyn
2008 B conf
Efficient layers-based schedules for iterative decoding of LDPC codes.
ISIT
Noam Presman, Eran Sharon, Simon Litsyn
2008 J jnl
Improved Upper Bounds on the Reliability Function of the Gaussian Channel.
IEEE Trans. Inf. Theory
Yael Ben-Haim, Simon Litsyn
2008 J jnl
On PMEPR of algebraic codes.
Eur. Trans. Telecommun.
Idan Alrod, Simon Litsyn, Alexander A. Yudin
2008 J jnl
On the Distribution of Boolean Function Nonlinearity.
SIAM J. Discret. Math.
Simon Litsyn, Alexander Shpunt
2008 B conf
Typical peak sidelobe level of binary sequences.
ISIT
Simon Litsyn, Alexander Shpunt
2007 J jnl
A Balancing Method for PMEPR Reduction in OFDM Signals.
IEEE Trans. Commun.
Simon Litsyn, Alexander Shpunt
2007 J jnl
A new upper bound on the rate of non-binary codes.
Adv. Math. Commun.
Yael Ben-Haim, Simon Litsyn
2007 J jnl
Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity.
IEEE Trans. Inf. Theory
Shay Freundlich, David Burshtein, Simon Litsyn
2007 B conf
Bounds for Codes in the Grassmann Manifold.
ISIT
Christine Bachoc, Yael Ben-Haim, Simon Litsyn
2007 J jnl
Breaking the ε-Soundness Bound of the Linearity Test over GF(2).
Electron. Colloquium Comput. Complex.
Tali Kaufman, Simon Litsyn, Ning Xie
2007 J jnl
Efficient Serial Message-Passing Schedules for LDPC Decoding.
IEEE Trans. Inf. Theory
Eran Sharon, Simon Litsyn, Jacob Goldberger
2007 J jnl
Improved lower bounds on sizes of single-error correcting codes.
Des. Codes Cryptogr.
Simon Litsyn, Beniamin Mounits
2007 J jnl
Lazy scheduling forLDPC decoding.
IEEE Commun. Lett.
Daniel Levin, Eran Sharon, Simon Litsyn
2007 J jnl
New upper bounds on codes via association schemes and linear programming.
Adv. Math. Commun.
Beniamin Mounits, Tuvi Etzion, Simon Litsyn
2007 — book
Peak power control in multicarrier communications.
Simon Litsyn
2006 B conf
A Method for Constructing LDPC Codes with Low Error Floor.
ISIT
Eran Sharon, Simon Litsyn
2006 B conf
A New Upper Bound on the Rate of Non-Binary Codes.
ISIT
Yael Ben-Haim, Simon Litsyn
2006 J jnl
Analysis of Low-Density Parity-Check Codes Based on EXIT Functions.
IEEE Trans. Commun.
Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn
2006 J jnl
Analysis of low-density parity-check codes based on EXIT functions.
IEEE Trans. Commun.
Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn
2006 B conf
Approximately Lower Triangular Ensembles of LPDC Codes with Linear Encoding Complexity.
ISIT
Shay Freundlich, David Burshtein, Simon Litsyn
2006 J jnl
EXIT Functions for Binary Input Memoryless Symmetric Channels.
IEEE Trans. Commun.
Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn
2006 J jnl
Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design.
IEEE Trans. Inf. Theory
Simon Litsyn, Gerhard Wunder
2006 J jnl
Improved Upper Bounds for Codes With Unequal Error Protection.
IEEE Trans. Inf. Theory
Shraga I. Bross, Simon Litsyn
2006 B conf
Improved Upper Bounds on the Reliability Function of the Gaussian Channel.
ISIT
Yael Ben-Haim, Simon Litsyn
2006 J jnl
Improved decoding of LDPC coded modulations.
IEEE Commun. Lett.
Yaniv Nana, Eran Sharon, Simon Litsyn
2006 — conf
Long Extended BCH Codes Are Spanned by Minimum Weight Words.
AAECC
Tali Kaufman, Simon Litsyn
2006 J jnl
On the peak-to-average power ratio of M-sequences.
Finite Fields Their Appl.
Idan Alrod, Simon Litsyn, Alexander A. Yudin
2006 J jnl
Upper bounds on the rate of LDPC codes as a function of minimum distance.
IEEE Trans. Inf. Theory
Yael Ben-Haim, Simon Litsyn
2005 A* conf
Almost Orthogonal Linear Codes are Locally Testable.
FOCS
Tali Kaufman, Simon Litsyn
2005 J jnl
Bounds on distance distributions in codes of known size.
IEEE Trans. Inf. Theory
Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
2005 — book
Covering Codes.
Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Antoine Lobstein
2005 J jnl
Discrete and continuous maxima in multicarrier communication.
IEEE Trans. Inf. Theory
Simon Litsyn, Alexander A. Yudin
2005 J jnl
Exact Minimum Density of Codes Identifying Vertices in the Square Grid.
SIAM J. Discret. Math.
Yael Ben-Haim, Simon Litsyn
2005 B conf
Improved upper bounds for codes with unequal error protection.
ISIT
Shraga I. Bross, Simon Litsyn
2005 J jnl
Lattices which are good for (almost) everything.
IEEE Trans. Inf. Theory
Uri Erez, Simon Litsyn, Ram Zamir
2005 J jnl
New Upper Bounds on A(n,d)
CoRR
Beniamin Mounits, Tuvi Etzion, Simon Litsyn
2005 B conf
New upper bounds on A(n, d).
ISIT
Beniamin Mounits, Tuvi Etzion, Simon Litsyn
2005 J jnl
Testing Reed-Muller codes.
IEEE Trans. Inf. Theory
Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
2005 B conf
Upper bounds on the rate of LDPC codes as a function of minimum distance.
ISIT
Yael Ben-Haim, Simon Litsyn
2004 J jnl
A method to suppress high peaks in BPSK-modulated OFDM signal.
IEEE Trans. Commun.
Gregory Freiman, Simon Litsyn, Alexander A. Yudin
2004 B conf
Bounds on distance distributions in codes of known size.
ISIT
Alexei Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
2004 B conf
EXIT functions for binary memoryless symmetric channels.
ISIT
Eran Sharon, Alexei Ashikhmin, Simon Litsyn
2004 B conf
Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design.
ISIT
Simon Litsyn, Gerhard Wunder
2004 B conf
On signals with very high peak-to-average power ratio.
ISIT
Gregory Freiman, Simon Litsyn, Alexander A. Yudin
2004 J jnl
Simple MAP Decoding of First-Order Reed-Muller and Hamming Codes.
IEEE Trans. Inf. Theory
Alexei E. Ashikhmin, Simon Litsyn
2003 J jnl
A Coding Theory Bound and Zero-Sum Square Matrices.
Graphs Comb.
Noga Alon, Simon Litsyn, Raphael Yuster
2003 J jnl
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori.
Discret. Appl. Math.
Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn
2003 J jnl
Distance distributions in ensembles of irregular low-density parity-check codes.
IEEE Trans. Inf. Theory
Simon Litsyn, Vladimir Shevelev
2003 J jnl
Erratum to "Intersecting codes and separating codes": [Discrete Applied Mathematics 128 (2003) 75-83].
Discret. Appl. Math.
Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun
2003 J jnl
Generalized hashing and parent-identifying codes.
J. Comb. Theory A
Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
2003 J jnl
Intersecting Codes and Separating Codes.
Discret. Appl. Math.
Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun
2003 B conf
Lattices which are good for (almost) everything.
ITW
Uri Erez, Simon Litsyn, Ram Zamir
2003 — conf
On the capacity of two-dimensional weight-constrained memories.
Algebraic Coding Theory and Information Theory
Simon Litsyn, Alexander Shpunt
2003 B conf
On the statistical distribution of the crest-factor of codes in OFDM transmission.
ITW
Gerhard Wunder, Simon Litsyn
2003 B conf
Simple MAP decoding of first order Reed-Muller and Hamming codes.
ITW
Alexei Ashikhmin, Simon Litsyn
2003 — conf
Testing Low-Degree Polynomials over GF(2(.
RANDOM-APPROX
Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
2002 J jnl
Improved upper bounds on sizes of codes.
IEEE Trans. Inf. Theory
Beniamin Mounits, Tuvi Etzion, Simon Litsyn
2002 J jnl
On ensembles of low-density parity-check codes: Asymptotic distance distributions.
IEEE Trans. Inf. Theory
Simon Litsyn, Vladimir Shevelev
2002 J jnl
Upper bounds on the rate of LDPC Codes.
IEEE Trans. Inf. Theory
David Burshtein, Michael Krivelevich, Simon Litsyn, Gadi Miller
2001 J jnl
A Z
IEEE Trans. Inf. Theory
Iwan M. Duursma, Marcus Greferath, Simon Litsyn, Stefan E. Schmidt
2001 J jnl
Binary B
J. Comb. Theory A
Gérard D. Cohen, Simon Litsyn, Gilles Zémor
2001 Misc conf
Binary Codes for Collusion-Secure Fingerprinting.
ICISC
Gérard D. Cohen, Simon Litsyn, Gilles Zémor
2001 J jnl
Bounds on identifying codes.
Discret. Math.
Uri Blass, Iiro S. Honkala, Simon Litsyn
2001 — ed.
Codes and Association Schemes, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, November 9-12, 1999
Codes and Association Schemes
Alexander Barg, Simon Litsyn
2001 J jnl
Estimates of the Distance Distribution of Codes and Designs.
Electron. Notes Discret. Math.
Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn
2001 J jnl
Estimates of the distance distribution of codes and designs.
IEEE Trans. Inf. Theory
Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn
2001 J jnl
Intersecting codes and partially identifying codes.
Electron. Notes Discret. Math.
Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn
2001 J jnl
On the Distance Distributions of BCH Codes and Their Duals.
Des. Codes Cryptogr.
Ilia Krasikov, Simon Litsyn
2001 — conf
On the Identification of Vertices and Edges Using Cycles.
AAECC
Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn
2000 J jnl
A new upper bound on the reliability function of the Gaussian channel.
IEEE Trans. Inf. Theory
Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn
2000 J jnl
An improved upper bound on the minimum distance of doubly-even self-dual codes.
IEEE Trans. Inf. Theory
Ilia Krasikov, Simon Litsyn
2000 J jnl
Quantum error detection I: Statement of the problem.
IEEE Trans. Inf. Theory
Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn
2000 J jnl
Quantum error detection II: Bounds.
IEEE Trans. Inf. Theory
Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn
1999 J jnl
Asymptotically exact bounds on the size of high-order spectral-null codes.
IEEE Trans. Inf. Theory
Gregory Freiman, Simon Litsyn
1999 — conf
Estimates of the distance distribution of nonbinary codes, with applications.
Codes and Association Schemes
Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn
1999 J jnl
More on the Distance Distribution of BCH Codes.
IEEE Trans. Inf. Theory
Osnat Keren, Simon Litsyn
1999 J jnl
New Bounds On Covering Radius as a Function of Dual Distance.
SIAM J. Discret. Math.
Tero Laihonen, Simon Litsyn
1999 J jnl
New Upper Bounds on Error Exponents.
IEEE Trans. Inf. Theory
Simon Litsyn
1999 J jnl
New Upper Bounds on Generalized Weights.
IEEE Trans. Inf. Theory
Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn
1999 J jnl
On binary constructions of quantum codes.
IEEE Trans. Inf. Theory
Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn
1999 J jnl
On relations between covering radius and dual distance.
IEEE Trans. Inf. Theory
Alexei E. Ashikhmin, Iiro S. Honkala, Tero Laihonen, Simon Litsyn
1999 — conf
On tHe Size of Identifying Codes.
AAECC
Uri Blass, Iiro S. Honkala, Simon Litsyn
1999 J jnl
On the Distance Distribution of Duals of BCH Codes.
IEEE Trans. Inf. Theory
Ilia Krasikov, Simon Litsyn
1999 J jnl
Polynomial method in coding and information theory
CoRR
Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn
1999 — conf
Survey of binary Krawtchouk polynomials.
Codes and Association Schemes
Ilia Krasikov, Simon Litsyn
1999 J jnl
The smallest covering code of length 8 and radius 2 has 12 words.
Ars Comb.
Uri Blass, Simon Litsyn
1999 J jnl
Upper Bounds on the Size of Quantum Codes.
IEEE Trans. Inf. Theory
Alexei E. Ashikhmin, Simon Litsyn
1998 J jnl
Bounds on Spectra of Codes with Known Dual Distance.
Des. Codes Cryptogr.
Ilia Krasikov, Simon Litsyn
1998 J jnl
Codes Correcting Phased Burst Erasures.
IEEE Trans. Inf. Theory
Osnat Keren, Simon Litsyn
1998 J jnl
On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes.
Des. Codes Cryptogr.
Tero Laihonen, Simon Litsyn
1998 J jnl
On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual Distance.
Discret. Appl. Math.
Simon Litsyn, Patrick Solé, René Struik
1998 J jnl
Several New Lower Bounds on the Size of Codes with Covering Radius One.
IEEE Trans. Inf. Theory
Uri Blass, Simon Litsyn
1998 J jnl
Several new lower bounds for football pool systems.
Ars Comb.
Uri Blass, Simon Litsyn
1997 J jnl
A class of array codes correcting multiple column erasures.
IEEE Trans. Inf. Theory
Osnat Keren, Simon Litsyn
1997 J jnl
Covering Radius 1985-1994.
Appl. Algebra Eng. Commun. Comput.
Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, H. F. Mattson Jr.
1997 J jnl
Estimates for the range of binomiality in codes' spectra.
IEEE Trans. Inf. Theory
Ilia Krasikov, Simon Litsyn
1997 J jnl
Linear Programming Bounds for Codes of Small Size.
Eur. J. Comb.
Ilia Krasikov, Simon Litsyn
1997 J jnl
Linear programming bounds for doubly-even self-dual codes.
IEEE Trans. Inf. Theory
Ilia Krasikov, Simon Litsyn
1997 J jnl
Long packing and covering codes.
IEEE Trans. Inf. Theory
Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Patrick Solé
1997 J jnl
On Covering Radius and Discrete Chebyshev Polynomials.
Appl. Algebra Eng. Commun. Comput.
Iiro S. Honkala, Tero Laihonen, Simon Litsyn
1997 J jnl
Parameters of Goppa codes revisited.
IEEE Trans. Inf. Theory
Françoise Levy-dit-Vehel, Simon Litsyn
1997 J jnl
Tiling Hamming Space with Few Spheres.
J. Comb. Theory A
Henk D. L. Hollmann, János Körner, Simon Litsyn
1996 J jnl
Fast Decoding Algorithms for First Order Reed-Muller and Related Codes.
Des. Codes Cryptogr.
Alexei E. Ashikhmin, Simon Litsyn
1996 J jnl
Fast decoding of non-binary first order Reed-Muller codes.
Appl. Algebra Eng. Commun. Comput.
Alexei E. Ashikhmin, Simon Litsyn
1996 J jnl
More on the covering radius of BCH codes.
IEEE Trans. Inf. Theory
Françoise Levy-dit-Vehel, Simon Litsyn
1996 J jnl
On Integral Zeros of Krawtchouk Polynomials.
J. Comb. Theory A
Ilia Krasikov, Simon Litsyn
1996 J jnl
On greedy algorithms in coding theory.
IEEE Trans. Inf. Theory
Gérard D. Cohen, Simon Litsyn, Gilles Zémor
1996 J jnl
On the traveling salesman problem in binary Hamming spaces.
IEEE Trans. Inf. Theory
Gérard D. Cohen, Simon Litsyn, Gilles Zémor
1996 J jnl
Tilings of Binary Spaces.
SIAM J. Discret. Math.
Gérard D. Cohen, Simon Litsyn, Alexander Vardy, Gilles Zémor
1996 J jnl
Upper Bounds on the Covering Radius of a Code with a Given Dual Distance.
Eur. J. Comb.
Simon Litsyn, Aimo Tietäväinen
1995 J jnl
Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points.
SIAM J. Discret. Math.
Heikki O. Hämäläinen, Iiro S. Honkala, Simon Litsyn, Patric R. J. Östergård
1995 — conf
On Algebraic Methods in Covering Radius Problems.
AAECC
Iiro S. Honkala, Simon Litsyn, Aimo Tietäväinen
1995 J jnl
On spectra of BCH codes.
IEEE Trans. Inf. Theory
Ilia Krasikov, Simon Litsyn
1995 — conf
On the Covering Radius of Long Goppa Codes.
AAECC
Françoise Levy-dit-Vehel, Simon Litsyn
1995 J jnl
On the accuracy of the binomial approximation to the distance distribution of codes.
IEEE Trans. Inf. Theory
Ilia Krasikov, Simon Litsyn
1995 J jnl
Two New Bounds on the Size of Binary Codes with a Minimum Distance of Three.
Des. Codes Cryptogr.
Yaron Klein, Simon Litsyn, Alexander Vardy
1995 J jnl
Weighted coverings and packings.
IEEE Trans. Inf. Theory
Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, H. F. Mattson Jr.
1994 J jnl
Character Sum Constructions of Constrained Error-Correcting Codes.
Appl. Algebra Eng. Commun. Comput.
Simon Litsyn, Aimo Tietäväinen
1994 J jnl
Divisibility Properties and New Bounds for Cyclic Codes and Exponential Sums in One and Several Variables.
Appl. Algebra Eng. Commun. Comput.
Simon Litsyn, Oscar Moreno, Carlos J. Moreno
1994 J jnl
The uniqueness of the Best code.
IEEE Trans. Inf. Theory
Simon Litsyn, Alexander Vardy
1994 J jnl
Upper bounds on generalized distances.
IEEE Trans. Inf. Theory
Gérard D. Cohen, Simon Litsyn, Gilles Zémor
1993 — ed.
Algebraic Coding, First French-Israeli Workshop, Paris, France, July 19-21, 1993, Proceedings
Algebraic Coding
Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor
1993 J jnl
Bounds for Binary Multiple Covering Codes.
Des. Codes Cryptogr.
Heikki O. Hämäläinen, Iiro S. Honkala, Markku K. Kaikkonen, Simon Litsyn
1993 J jnl
Error-correcting codes with bounded running digital sum.
IEEE Trans. Inf. Theory
Mario Blaum, Simon Litsyn, Vincent Buskens, Henk C. A. van Tilborg
1993 — conf
Two new upper bounds for codes of distance 3.
Algebraic Coding
Simon Litsyn, Alexander Vardy
1992 — ed.
Algebraic Coding, First French-Soviet Workshop, Paris, France, July 22-24, 1991, Proceedings
Algebraic Coding
Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor
1992 J jnl
On the covering radius of Reed-Muller codes.
Discret. Math.
Gérard D. Cohen, Simon Litsyn
1991 — conf
A Fast Search for the Maximum Element of the Fourier Spectrum.
Algebraic Coding
Alexei E. Ashikhmin, Simon Litsyn
1991 J jnl
A note on perfect multiple covetings of the Hamming space.
IEEE Trans. Inf. Theory
Gerhard J. M. van Wee, Gérard D. Cohen, Simon Litsyn
1991 J jnl
DC-constrained codes from Hadamard matrices.
IEEE Trans. Inf. Theory
Alexander Barg, Simon Litsyn
1991 J jnl
DC-constrained error-correcting codes with small running digital sum.
IEEE Trans. Inf. Theory
Gérard D. Cohen, Simon Litsyn
1991 — conf
Fast Algorithms for Decoding Orthogonal and Related Codes.
AAECC
Simon Litsyn
1991 — conf
On Perfect Weighted Coverings with Small Radius.
Algebraic Coding
Gérard D. Cohen, Simon Litsyn, H. F. Mattson Jr.
1986 J jnl
A note on lower bounds.
IEEE Trans. Inf. Theory
Simon Litsyn, Michael A. Tsfasman