| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn |
An Analytical Approach to the Calculation of EVM in Clipped Multi-Carrier Signals.  |
IEEE Transactions on Communications  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard Wunder, R. F. H. Fischer, Simon Litsyn, J. S. No |
Precoding and Transmitter-Side processing techniques for multiuser MIMO OFDM systems with special emphasis on the PAPR problem.  |
EURASIP J. Adv. Sig. Proc.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Igal Kotzer, Simon Litsyn |
On the EVM computation of arbitrary clipped multi-carrier signals.  |
EURASIP J. Adv. Sig. Proc.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Blinovsky, Simon Litsyn |
New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere.  |
Discrete & Computational Geometry  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Noam Presman, Ofer Shapira, Simon Litsyn |
Binary Polar Code Kernels from Code Decompositions  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Noam Presman, Ofer Shapira, Simon Litsyn |
Polar Codes with Mixed Kernels  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Noam Presman, Ofer Shapira, Simon Litsyn |
Binary polar code kernels from code decompositions.  |
ISIT  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn |
On the EVM of sequences.  |
ISIT  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Cassuto, Simon Litsyn |
Symbol-pair codes: Algebraic constructions and asymptotic bounds.  |
ISIT  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Noam Presman, Ofer Shapira, Simon Litsyn |
Polar codes with mixed kernels.  |
ISIT  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Simon Litsyn, Ning Xie |
Breaking the Epsilon-Soundness Bound of the Linearity Test over GF(2).  |
SIAM J. Comput.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Blinovsky, Uri Erez, Simon Litsyn |
Weight distribution moments of random linear/coset codes.  |
Des. Codes Cryptography  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Simon Litsyn, Alexander Shpunt |
Typical peak sidelobe level of binary sequences.  |
IEEE Transactions on Information Theory  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eran Sharon, Noam Presman, Simon Litsyn |
Convergence analysis of generalized serial message-passing schedules.  |
IEEE Journal on Selected Areas in Communications  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Blinovsky, Simon Litsyn |
New asymptotic bounds on the size of list codes on Euclidean sphere.  |
ISIT  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Eran Sharon, Omer Fainzilber, Simon Litsyn |
Decreasing error floor in LDPC codes by parity-check matrix extensions.  |
ISIT  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Eran Sharon, Noam Presman, Simon Litsyn |
Analysis of LDPC decoding schedules.  |
ISIT  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Eran Sharon, Simon Litsyn |
Constructing LDPC codes by error minimization progressive edge growth.  |
IEEE Transactions on Communications  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon Litsyn, Alexander Shpunt |
On the Distribution of Boolean Function Nonlinearity.  |
SIAM J. Discrete Math.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Idan Alrod, Simon Litsyn, Alexander Yudin |
On PMEPR of algebraic codes.  |
European Transactions on Telecommunications  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yael Ben-Haim, Simon Litsyn |
Improved Upper Bounds on the Reliability Function of the Gaussian Channel.  |
IEEE Transactions on Information Theory  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christine Bachoc, Yael Ben-Haim, Simon Litsyn |
Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds.  |
IEEE Transactions on Information Theory  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Noam Presman, Eran Sharon, Simon Litsyn |
Efficient layers-based schedules for iterative decoding of LDPC codes.  |
ISIT  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon Litsyn, Alexander Shpunt |
Typical peak sidelobe level of binary sequences.  |
ISIT  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Simon Litsyn, Ning Xie |
Breaking the epsilon-Soundness Bound of the Linearity Test over GF(2).  |
APPROX-RANDOM  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon Litsyn, Alexander Shpunt |
A Balancing Method for PMEPR Reduction in OFDM Signals.  |
IEEE Transactions on Communications  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Simon Litsyn, Ning Xie |
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2).  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Daniel Levin, Eran Sharon, Simon Litsyn |
Lazy scheduling forLDPC decoding.  |
IEEE Communications Letters  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon Litsyn, Beniamin Mounits |
Improved lower bounds on sizes of single-error correcting codes.  |
Des. Codes Cryptography  |
2007 |
DBLP DOI BibTeX RDF |
AMS Classification 94B25 |
| 1 | Eran Sharon, Simon Litsyn, Jacob Goldberger |
Efficient Serial Message-Passing Schedules for LDPC Decoding.  |
IEEE Transactions on Information Theory  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Freundlich, David Burshtein, Simon Litsyn |
Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity.  |
IEEE Transactions on Information Theory  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon Litsyn |
Peak power control in multicarrier communications.  |
|
2007 |
RDF |
|
| 1 | Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn |
Analysis of Low-Density Parity-Check Codes Based on EXIT Functions.  |
IEEE Transactions on Communications  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn |
EXIT Functions for Binary Input Memoryless Symmetric Channels.  |
IEEE Transactions on Communications  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn |
Analysis of low-density parity-check codes based on EXIT functions.  |
IEEE Transactions on Communications  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Idan Alrod, Simon Litsyn, Alexander Yudin |
On the peak-to-average power ratio of M-sequences.  |
Finite Fields and Their Applications  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaniv Nana, Eran Sharon, Simon Litsyn |
Improved decoding of LDPC coded modulations.  |
IEEE Communications Letters  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yael Ben-Haim, Simon Litsyn |
Upper bounds on the rate of LDPC codes as a function of minimum distance.  |
IEEE Transactions on Information Theory  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Shraga I. Bross, Simon Litsyn |
Improved Upper Bounds for Codes With Unequal Error Protection.  |
IEEE Transactions on Information Theory  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon Litsyn, Gerhard Wunder |
Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design.  |
IEEE Transactions on Information Theory  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Simon Litsyn |
Long Extended BCH Codes Are Spanned by Minimum Weight Words.  |
AAECC  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Beniamin Mounits, Tuvi Etzion, Simon Litsyn |
New Upper Bounds on A(n,d)  |
CoRR  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Yael Ben-Haim, Simon Litsyn |
Exact Minimum Density of Codes Identifying Vertices in the Square Grid.  |
SIAM J. Discrete Math.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Uri Erez, Simon Litsyn, Ram Zamir |
Lattices which are good for (almost) everything.  |
IEEE Transactions on Information Theory  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn |
Bounds on distance distributions in codes of known size.  |
IEEE Transactions on Information Theory  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron |
Testing Reed-Muller codes.  |
IEEE Transactions on Information Theory  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon Litsyn, Alexander Yudin |
Discrete and continuous maxima in multicarrier communication.  |
IEEE Transactions on Information Theory  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Simon Litsyn |
Almost Orthogonal Linear Codes are Locally Testable.  |
FOCS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Freiman, Simon Litsyn, Alexander Yudin |
A method to suppress high peaks in BPSK-modulated OFDM signal.  |
IEEE Transactions on Communications  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexei E. Ashikhmin, Simon Litsyn |
Simple MAP Decoding of First-Order Reed-Muller and Hamming Codes.  |
IEEE Transactions on Information Theory  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn |
Generalized hashing and parent-identifying codes.  |
J. Comb. Theory, Ser. A  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Simon Litsyn, Raphael Yuster |
A Coding Theory Bound and Zero-Sum Square Matrices.  |
Graphs and Combinatorics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun |
Intersecting Codes and Separating Codes.  |
Discrete Applied Mathematics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn |
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori.  |
Discrete Applied Mathematics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon Litsyn, Vladimir Shevelev |
Distance distributions in ensembles of irregular low-density parity-check codes.  |
IEEE Transactions on Information Theory  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron |
Testing Low-Degree Polynomials over GF(2(.  |
RANDOM-APPROX  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon Litsyn, Vladimir Shevelev |
On ensembles of low-density parity-check codes: Asymptotic distance distributions.  |
IEEE Transactions on Information Theory  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | David Burshtein, Michael Krivelevich, Simon Litsyn, Gadi Miller |
Upper bounds on the rate of LDPC Codes.  |
IEEE Transactions on Information Theory  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Beniamin Mounits, Tuvi Etzion, Simon Litsyn |
Improved upper bounds on sizes of codes.  |
IEEE Transactions on Information Theory  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gérard D. Cohen, Simon Litsyn, Gilles Zémor |
Binary B2-Sequences : A New Upper Bound.  |
J. Comb. Theory, Ser. A  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn |
Estimates of the Distance Distribution of Codes and Designs.  |
Electronic Notes in Discrete Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn |
Intersecting codes and partially identifying codes.  |
Electronic Notes in Discrete Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Uri Blass, Iiro S. Honkala, Simon Litsyn |
Bounds on identifying codes.  |
Discrete Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilia Krasikov, Simon Litsyn |
On the Distance Distributions of BCH Codes and Their Duals.  |
Des. Codes Cryptography  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn |
Estimates of the distance distribution of codes and designs.  |
IEEE Transactions on Information Theory  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Iwan M. Duursma, Marcus Greferath, Simon Litsyn, Stefan E. Schmidt |
A Z8-linear lift of the binary Golay code and a nonlinear Binary (96, 237, 24)-code.  |
IEEE Transactions on Information Theory  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Gérard D. Cohen, Simon Litsyn, Gilles Zémor |
Binary Codes for Collusion-Secure Fingerprinting.  |
ICISC  |
2001 |
DBLP DOI BibTeX RDF |
Collusion-resistant code, intersecting code, B2-sequence, watermarking, Fingerprinting |
| 1 | Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn |
On the Identification of Vertices and Edges Using Cycles.  |
AAECC  |
2001 |
DBLP DOI BibTeX RDF |
binary hypercube, Lee metric, graph, multiprocessor system, Identification, cycle, Hamming distance |
| 1 | Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn |
Quantum error detection II: Bounds.  |
IEEE Transactions on Information Theory  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn |
A new upper bound on the reliability function of the Gaussian channel.  |
IEEE Transactions on Information Theory  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn |
Quantum error detection I: Statement of the problem.  |
IEEE Transactions on Information Theory  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilia Krasikov, Simon Litsyn |
An improved upper bound on the minimum distance of doubly-even self-dual codes.  |
IEEE Transactions on Information Theory  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn |
Polynomial method in coding and information theory  |
CoRR  |
1999 |
DBLP BibTeX RDF |
|
| 1 | Tero Laihonen, Simon Litsyn |
New Bounds On Covering Radius as a Function of Dual Distance.  |
SIAM J. Discrete Math.  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Uri Blass, Simon Litsyn |
The smallest covering code of length 8 and radius 2 has 12 words.  |
Ars Comb.  |
1999 |
DBLP BibTeX RDF |
|
| 1 | Simon Litsyn |
New Upper Bounds on Error Exponents.  |
IEEE Transactions on Information Theory  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexei E. Ashikhmin, Iiro S. Honkala, Tero Laihonen, Simon Litsyn |
On relations between covering radius and dual distance.  |
IEEE Transactions on Information Theory  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn |
New Upper Bounds on Generalized Weights.  |
IEEE Transactions on Information Theory  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexei E. Ashikhmin, Simon Litsyn |
Upper Bounds on the Size of Quantum Codes.  |
IEEE Transactions on Information Theory  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn |
On binary constructions of quantum codes.  |
IEEE Transactions on Information Theory  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilia Krasikov, Simon Litsyn |
On the Distance Distribution of Duals of BCH Codes.  |
IEEE Transactions on Information Theory  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Osnat Keren, Simon Litsyn |
More on the Distance Distribution of BCH Codes.  |
IEEE Transactions on Information Theory  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Freiman, Simon Litsyn |
Asymptotically exact bounds on the size of high-order spectral-null codes.  |
IEEE Transactions on Information Theory  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Uri Blass, Iiro S. Honkala, Simon Litsyn |
On tHe Size of Identifying Codes.  |
AAECC  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon Litsyn, Patrick Solé, René Struik |
On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual Distance.  |
Discrete Applied Mathematics  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Uri Blass, Simon Litsyn |
Several new lower bounds for football pool systems.  |
Ars Comb.  |
1998 |
DBLP BibTeX RDF |
|
| 1 | Tero Laihonen, Simon Litsyn |
On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes.  |
Des. Codes Cryptography  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilia Krasikov, Simon Litsyn |
Bounds on Spectra of Codes with Known Dual Distance.  |
Des. Codes Cryptography  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Osnat Keren, Simon Litsyn |
Codes Correcting Phased Burst Erasures.  |
IEEE Transactions on Information Theory  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Uri Blass, Simon Litsyn |
Several New Lower Bounds on the Size of Codes with Covering Radius One.  |
IEEE Transactions on Information Theory  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Henk D. L. Hollmann, János Körner, Simon Litsyn |
Tiling Hamming Space with Few Spheres.  |
J. Comb. Theory, Ser. A  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilia Krasikov, Simon Litsyn |
Linear Programming Bounds for Codes of Small Size.  |
Eur. J. Comb.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, H. F. Mattson Jr. |
Covering Radius 1985-1994.  |
Appl. Algebra Eng. Commun. Comput.  |
1997 |
DBLP DOI BibTeX RDF |
Amalgamated direct sum, Blockwise direct sum, Density of coverings, Dual distance, Excess method, Sphere-covering bound, Normality, Reed-Muller codes, Covering radius, Binary codes, BCH codes |
| 1 | Iiro S. Honkala, Tero Laihonen, Simon Litsyn |
On Covering Radius and Discrete Chebyshev Polynomials.  |
Appl. Algebra Eng. Commun. Comput.  |
1997 |
DBLP DOI BibTeX RDF |
Dual distance, Discrete Chebyshev polynomials, Code, Covering radius |
| 1 | Ilia Krasikov, Simon Litsyn |
Estimates for the range of binomiality in codes' spectra.  |
IEEE Transactions on Information Theory  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Osnat Keren, Simon Litsyn |
A class of array codes correcting multiple column erasures.  |
IEEE Transactions on Information Theory  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Patrick Solé |
Long packing and covering codes.  |
IEEE Transactions on Information Theory  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilia Krasikov, Simon Litsyn |
Linear programming bounds for doubly-even self-dual codes.  |
IEEE Transactions on Information Theory  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Françoise Levy-dit-Vehel, Simon Litsyn |
Parameters of Goppa codes revisited.  |
IEEE Transactions on Information Theory  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilia Krasikov, Simon Litsyn |
On Integral Zeros of Krawtchouk Polynomials.  |
J. Comb. Theory, Ser. A  |
1996 |
DBLP DOI BibTeX RDF |
|