| 2008 |
|---|
| 106 | EE | Tali Kaufman,
Simon Litsyn,
Ning Xie:
Breaking the epsilon-Soundness Bound of the Linearity Test over GF(2).
APPROX-RANDOM 2008: 498-511 |
| 105 | EE | Eran Sharon,
Simon Litsyn:
Constructing LDPC codes by error minimization progressive edge growth.
IEEE Transactions on Communications 56(3): 359-368 (2008) |
| 104 | EE | Yael Ben-Haim,
Simon Litsyn:
Improved Upper Bounds on the Reliability Function of the Gaussian Channel.
IEEE Transactions on Information Theory 54(1): 5-12 (2008) |
| 103 | EE | Christine Bachoc,
Yael Ben-Haim,
Simon Litsyn:
Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds.
IEEE Transactions on Information Theory 54(3): 1024-1035 (2008) |
| 2007 |
|---|
| 102 | EE | Simon Litsyn,
Beniamin Mounits:
Improved lower bounds on sizes of single-error correcting codes.
Des. Codes Cryptography 42(1): 67-72 (2007) |
| 101 | EE | Tali Kaufman,
Simon Litsyn,
Ning Xie:
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2).
Electronic Colloquium on Computational Complexity (ECCC) 14(098): (2007) |
| 100 | EE | Simon Litsyn,
A. Shpunt:
A Balancing Method for PMEPR Reduction in OFDM Signals.
IEEE Transactions on Communications 55(4): 683-691 (2007) |
| 99 | EE | Eran Sharon,
Simon Litsyn,
Jacob Goldberger:
Efficient Serial Message-Passing Schedules for LDPC Decoding.
IEEE Transactions on Information Theory 53(11): 4076-4091 (2007) |
| 98 | EE | S. Freundlich,
David Burshtein,
Simon Litsyn:
Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity.
IEEE Transactions on Information Theory 53(4): 1484-1494 (2007) |
| 2006 |
|---|
| 97 | EE | Tali Kaufman,
Simon Litsyn:
Long Extended BCH Codes Are Spanned by Minimum Weight Words.
AAECC 2006: 285-294 |
| 96 | EE | Eran Sharon,
Alexei E. Ashikhmin,
Simon Litsyn:
EXIT Functions for Binary Input Memoryless Symmetric Channels.
IEEE Transactions on Communications 54(7): 1207-1214 (2006) |
| 95 | EE | Eran Sharon,
Alexei E. Ashikhmin,
Simon Litsyn:
Analysis of Low-Density Parity-Check Codes Based on EXIT Functions.
IEEE Transactions on Communications 54(7): 1349-1349 (2006) |
| 94 | EE | Eran Sharon,
Alexei E. Ashikhmin,
Simon Litsyn:
Analysis of low-density parity-check codes based on EXIT functions.
IEEE Transactions on Communications 54(8): 1407-1414 (2006) |
| 93 | EE | Simon Litsyn,
Gerhard Wunder:
Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design.
IEEE Transactions on Information Theory 52(3): 992-1006 (2006) |
| 92 | EE | Yael Ben-Haim,
Simon Litsyn:
Upper bounds on the rate of LDPC codes as a function of minimum distance.
IEEE Transactions on Information Theory 52(5): 2092-2100 (2006) |
| 91 | EE | Shraga I. Bross,
Simon Litsyn:
Improved Upper Bounds for Codes With Unequal Error Protection.
IEEE Transactions on Information Theory 52(7): 3329-3333 (2006) |
| 2005 |
|---|
| 90 | EE | Tali Kaufman,
Simon Litsyn:
Almost Orthogonal Linear Codes are Locally Testable.
FOCS 2005: 317-326 |
| 89 | EE | Beniamin Mounits,
Tuvi Etzion,
Simon Litsyn:
New Upper Bounds on A(n,d)
CoRR abs/cs/0508107: (2005) |
| 88 | EE | 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 51(1): 250-258 (2005) |
| 87 | EE | Uri Erez,
Simon Litsyn,
Ram Zamir:
Lattices which are good for (almost) everything.
IEEE Transactions on Information Theory 51(10): 3401-3416 (2005) |
| 86 | EE | Noga Alon,
Tali Kaufman,
Michael Krivelevich,
Simon Litsyn,
Dana Ron:
Testing Reed-Muller codes.
IEEE Transactions on Information Theory 51(11): 4032-4039 (2005) |
| 85 | EE | Simon Litsyn,
Alexander Yudin:
Discrete and continuous maxima in multicarrier communication.
IEEE Transactions on Information Theory 51(3): 919-928 (2005) |
| 84 | EE | Yael Ben-Haim,
Simon Litsyn:
Exact Minimum Density of Codes Identifying Vertices in the Square Grid.
SIAM J. Discrete Math. 19(1): 69-82 (2005) |
| 2004 |
|---|
| 83 | EE | Gregory Freiman,
Simon Litsyn,
Alexander Yudin:
A method to suppress high peaks in BPSK-modulated OFDM signal.
IEEE Transactions on Communications 52(9): 1440-1443 (2004) |
| 82 | | Alexei E. Ashikhmin,
Simon Litsyn:
Simple MAP Decoding of First-Order Reed-Muller and Hamming Codes.
IEEE Transactions on Information Theory 50(8): 1812-1818 (2004) |
| 2003 |
|---|
| 81 | EE | Noga Alon,
Tali Kaufman,
Michael Krivelevich,
Simon Litsyn,
Dana Ron:
Testing Low-Degree Polynomials over GF(2(.
RANDOM-APPROX 2003: 188-199 |
| 80 | EE | Gérard D. Cohen,
Sylvia B. Encheva,
Simon Litsyn,
Hans Georg Schaathun:
Intersecting Codes and Separating Codes.
Discrete Applied Mathematics 128(1): 75-83 (2003) |
| 79 | EE | Iiro S. Honkala,
Mark G. Karpovsky,
Simon Litsyn:
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori.
Discrete Applied Mathematics 129(2-3): 409-419 (2003) |
| 78 | EE | Noga Alon,
Simon Litsyn,
Raphael Yuster:
A Coding Theory Bound and Zero-Sum Square Matrices.
Graphs and Combinatorics 19(4): 449-457 (2003) |
| 77 | | Simon Litsyn,
Vladimir Shevelev:
Distance distributions in ensembles of irregular low-density parity-check codes.
IEEE Transactions on Information Theory 49(12): 3140-3159 (2003) |
| 76 | EE | Noga Alon,
Gérard D. Cohen,
Michael Krivelevich,
Simon Litsyn:
Generalized hashing and parent-identifying codes.
J. Comb. Theory, Ser. A 104(1): 207-215 (2003) |
| 2002 |
|---|
| 75 | | Beniamin Mounits,
Tuvi Etzion,
Simon Litsyn:
Improved upper bounds on sizes of codes.
IEEE Transactions on Information Theory 48(4): 880-886 (2002) |
| 74 | | Simon Litsyn,
Vladimir Shevelev:
On ensembles of low-density parity-check codes: Asymptotic distance distributions.
IEEE Transactions on Information Theory 48(4): 887-908 (2002) |
| 73 | | David Burshtein,
Michael Krivelevich,
Simon Litsyn,
Gadi Miller:
Upper bounds on the rate of LDPC Codes.
IEEE Transactions on Information Theory 48(9): 2437-2449 (2002) |
| 2001 |
|---|
| 72 | EE | Iiro S. Honkala,
Mark G. Karpovsky,
Simon Litsyn:
On the Identification of Vertices and Edges Using Cycles.
AAECC 2001: 308-314 |
| 71 | EE | Gérard D. Cohen,
Simon Litsyn,
Gilles Zémor:
Binary Codes for Collusion-Secure Fingerprinting.
ICISC 2001: 178-185 |
| 70 | | Ilia Krasikov,
Simon Litsyn:
On the Distance Distributions of BCH Codes and Their Duals.
Des. Codes Cryptography 23(2): 223-232 (2001) |
| 69 | EE | Uri Blass,
Iiro S. Honkala,
Simon Litsyn:
Bounds on identifying codes.
Discrete Mathematics 241(1-3): 119-128 (2001) |
| 68 | EE | Gérard D. Cohen,
Sylvia B. Encheva,
Simon Litsyn:
Intersecting codes and partially identifying codes.
Electronic Notes in Discrete Mathematics 6: 211-219 (2001) |
| 67 | EE | Alexei E. Ashikhmin,
Alexander Barg,
Simon Litsyn:
Estimates of the Distance Distribution of Codes and Designs.
Electronic Notes in Discrete Mathematics 6: 4-14 (2001) |
| 66 | | Alexei E. Ashikhmin,
Alexander Barg,
Simon Litsyn:
Estimates of the distance distribution of codes and designs.
IEEE Transactions on Information Theory 47(3): 1050-1061 (2001) |
| 65 | | 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 47(4): 1596-1598 (2001) |
| 64 | EE | Gérard D. Cohen,
Simon Litsyn,
Gilles Zémor:
Binary B2-Sequences : A New Upper Bound.
J. Comb. Theory, Ser. A 94(1): 152-155 (2001) |
| 2000 |
|---|
| 63 | | Ilia Krasikov,
Simon Litsyn:
An improved upper bound on the minimum distance of doubly-even self-dual codes.
IEEE Transactions on Information Theory 46(1): 274-278 (2000) |
| 62 | | Alexei E. Ashikhmin,
Alexander Barg,
Emanuel Knill,
Simon Litsyn:
Quantum error detection I: Statement of the problem.
IEEE Transactions on Information Theory 46(3): 778-788 (2000) |
| 61 | | Alexei E. Ashikhmin,
Alexander Barg,
Emanuel Knill,
Simon Litsyn:
Quantum error detection II: Bounds.
IEEE Transactions on Information Theory 46(3): 789-800 (2000) |
| 60 | | Alexei E. Ashikhmin,
Alexander Barg,
Simon Litsyn:
A new upper bound on the reliability function of the Gaussian channel.
IEEE Transactions on Information Theory 46(6): 1945-1961 (2000) |
| 1999 |
|---|
| 59 | | Uri Blass,
Iiro S. Honkala,
Simon Litsyn:
On tHe Size of Identifying Codes.
AAECC 1999: 142-147 |
| 58 | | Uri Blass,
Simon Litsyn:
The smallest covering code of length 8 and radius 2 has 12 words.
Ars Comb. 52: (1999) |
| 57 | EE | Alexei E. Ashikhmin,
Alexander Barg,
Simon Litsyn:
Polynomial method in coding and information theory
CoRR math.CO/9910175: (1999) |
| 56 | | Ilia Krasikov,
Simon Litsyn:
On the Distance Distribution of Duals of BCH Codes.
IEEE Transactions on Information Theory 45(1): 247-250 (1999) |
| 55 | | Osnat Keren,
Simon Litsyn:
More on the Distance Distribution of BCH Codes.
IEEE Transactions on Information Theory 45(1): 251-255 (1999) |
| 54 | | Simon Litsyn:
New Upper Bounds on Error Exponents.
IEEE Transactions on Information Theory 45(2): 385-398 (1999) |
| 53 | | Alexei E. Ashikhmin,
Simon Litsyn:
Upper Bounds on the Size of Quantum Codes.
IEEE Transactions on Information Theory 45(4): 1206-1215 (1999) |
| 52 | | Alexei E. Ashikhmin,
Alexander Barg,
Simon Litsyn:
New Upper Bounds on Generalized Weights.
IEEE Transactions on Information Theory 45(4): 1258-1263 (1999) |
| 51 | | Gregory Freiman,
Simon Litsyn:
Asymptotically exact bounds on the size of high-order spectral-null codes.
IEEE Transactions on Information Theory 45(6): 1798-1807 (1999) |
| 50 | | Alexei E. Ashikhmin,
Iiro S. Honkala,
Tero Laihonen,
Simon Litsyn:
On relations between covering radius and dual distance.
IEEE Transactions on Information Theory 45(6): 1808-1816 (1999) |
| 49 | | Gérard D. Cohen,
Sylvia B. Encheva,
Simon Litsyn:
On binary constructions of quantum codes.
IEEE Transactions on Information Theory 45(7): 2495-2498 (1999) |
| 48 | EE | Tero Laihonen,
Simon Litsyn:
New Bounds On Covering Radius as a Function of Dual Distance.
SIAM J. Discrete Math. 12(2): 243-251 (1999) |
| 1998 |
|---|
| 47 | | Uri Blass,
Simon Litsyn:
Several new lower bounds for football pool systems.
Ars Comb. 50: (1998) |
| 46 | | Ilia Krasikov,
Simon Litsyn:
Bounds on Spectra of Codes with Known Dual Distance.
Des. Codes Cryptography 13(3): 285-297 (1998) |
| 45 | | Tero Laihonen,
Simon Litsyn:
On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes.
Des. Codes Cryptography 14(1): 71-80 (1998) |
| 44 | EE | 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 82(1-3): 177-191 (1998) |
| 43 | | Osnat Keren,
Simon Litsyn:
Codes Correcting Phased Burst Erasures.
IEEE Transactions on Information Theory 44(1): 416-420 (1998) |
| 42 | | Uri Blass,
Simon Litsyn:
Several New Lower Bounds on the Size of Codes with Covering Radius One.
IEEE Transactions on Information Theory 44(5): 1998-2002 (1998) |
| 1997 |
|---|
| 41 | EE | Gérard D. Cohen,
Simon Litsyn,
Antoine Lobstein,
H. F. Mattson Jr.:
Covering Radius 1985-1994.
Appl. Algebra Eng. Commun. Comput. 8(3): 173-239 (1997) |
| 40 | EE | Iiro S. Honkala,
Tero Laihonen,
Simon Litsyn:
On Covering Radius and Discrete Chebyshev Polynomials.
Appl. Algebra Eng. Commun. Comput. 8(5): 395-401 (1997) |
| 39 | EE | Ilia Krasikov,
Simon Litsyn:
Linear Programming Bounds for Codes of Small Size.
Eur. J. Comb. 18(6): 647-656 (1997) |
| 38 | | Ilia Krasikov,
Simon Litsyn:
Estimates for the range of binomiality in codes' spectra.
IEEE Transactions on Information Theory 43(3): 987-991 (1997) |
| 37 | | Ilia Krasikov,
Simon Litsyn:
Linear programming bounds for doubly-even self-dual codes.
IEEE Transactions on Information Theory 43(4): 1238-1244 (1997) |
| 36 | | Gérard D. Cohen,
Iiro S. Honkala,
Simon Litsyn,
Patrick Solé:
Long packing and covering codes.
IEEE Transactions on Information Theory 43(5): 1617-1619 (1997) |
| 35 | | Françoise Levy-dit-Vehel,
Simon Litsyn:
Parameters of Goppa codes revisited.
IEEE Transactions on Information Theory 43(6): 1811-1819 (1997) |
| 34 | | Osnat Keren,
Simon Litsyn:
A class of array codes correcting multiple column erasures.
IEEE Transactions on Information Theory 43(6): 1843-1851 (1997) |
| 33 | EE | Henk D. L. Hollmann,
János Körner,
Simon Litsyn:
Tiling Hamming Space with Few Spheres.
J. Comb. Theory, Ser. A 80(2): 388-393 (1997) |
| 1996 |
|---|
| 32 | EE | Alexei E. Ashikhmin,
Simon Litsyn:
Fast Decoding of Non-Binary First Order Reed-Muller Codes.
Appl. Algebra Eng. Commun. Comput. 7(4): 299-308 (1996) |
| 31 | | Alexei E. Ashikhmin,
Simon Litsyn:
Fast Decoding Algorithms for First Order Reed-Muller and Related Codes.
Des. Codes Cryptography 7(3): 187-214 (1996) |
| 30 | EE | Simon Litsyn,
Aimo Tietäväinen:
Upper Bounds on the Covering Radius of a Code with a Given Dual Distance.
Eur. J. Comb. 17(2-3): 265-270 (1996) |
| 29 | | Françoise Levy-dit-Vehel,
Simon Litsyn:
More on the covering radius of BCH codes.
IEEE Transactions on Information Theory 42(3): 1023-1028 (1996) |
| 28 | | Gérard D. Cohen,
Simon Litsyn,
Gilles Zémor:
On the traveling salesman problem in binary Hamming spaces.
IEEE Transactions on Information Theory 42(4): 1274-1276 (1996) |
| 27 | | Gérard D. Cohen,
Simon Litsyn,
Gilles Zémor:
On greedy algorithms in coding theory.
IEEE Transactions on Information Theory 42(6): 2053-2057 (1996) |
| 26 | EE | Ilia Krasikov,
Simon Litsyn:
On Integral Zeros of Krawtchouk Polynomials.
J. Comb. Theory, Ser. A 74(1): 71-99 (1996) |
| 25 | EE | Gérard D. Cohen,
Simon Litsyn,
Alexander Vardy,
Gilles Zémor:
Tilings of Binary Spaces.
SIAM J. Discrete Math. 9(3): 393-412 (1996) |
| 1995 |
|---|
| 24 | | Iiro S. Honkala,
Simon Litsyn,
Aimo Tietäväinen:
On Algebraic Methods in Covering Radius Problems.
AAECC 1995: 21-32 |
| 23 | | Françoise Levy-dit-Vehel,
Simon Litsyn:
On the Covering Radius of Long Goppa Codes.
AAECC 1995: 341-346 |
| 22 | | Yaron Klein,
Simon Litsyn,
Alexander Vardy:
Two New Bounds on the Size of Binary Codes with a Minimum Distance of Three.
Des. Codes Cryptography 6(3): 219-227 (1995) |
| 21 | | Ilia Krasikov,
Simon Litsyn:
On spectra of BCH codes.
IEEE Transactions on Information Theory 41(3): 786-788 (1995) |
| 20 | | Ilia Krasikov,
Simon Litsyn:
On the accuracy of the binomial approximation to the distance distribution of codes.
IEEE Transactions on Information Theory 41(5): 1472-1474 (1995) |
| 19 | | Gérard D. Cohen,
Iiro S. Honkala,
Simon Litsyn,
H. F. Mattson Jr.:
Weighted coverings and packings.
IEEE Transactions on Information Theory 41(6): 1856-1867 (1995) |
| 18 | EE | Heikki O. Hämäläinen,
Iiro S. Honkala,
Simon Litsyn,
Patric R. J. Östergård:
Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points.
SIAM J. Discrete Math. 8(2): 196-207 (1995) |
| 1994 |
|---|
| 17 | | Simon Litsyn,
Oscar Moreno,
Carlos J. Moreno:
Divisibility Properties and New Bounds for Cyclic Codes and Exponential Sums in One and Several Variables.
Appl. Algebra Eng. Commun. Comput. 5: 105-116 (1994) |
| 16 | | Simon Litsyn,
Aimo Tietäväinen:
Character Sum Constructions of Constrained Error-Correcting Codes.
Appl. Algebra Eng. Commun. Comput. 5: 45-51 (1994) |
| 15 | | Simon Litsyn,
Alexander Vardy:
The uniqueness of the Best code.
IEEE Transactions on Information Theory 40(5): 1693- (1994) |
| 14 | | Gérard D. Cohen,
Simon Litsyn,
Gilles Zémor:
Upper bounds on generalized distances.
IEEE Transactions on Information Theory 40(6): 2090- (1994) |
| 1993 |
|---|
| 13 | | Gérard D. Cohen,
Simon Litsyn,
Antoine Lobstein,
Gilles Zémor:
Algebraic Coding, First French-Israeli Workshop, Paris, France, July 19-21, 1993, Proceedings
Springer 1993 |
| 12 | | Simon Litsyn,
Alexander Vardy:
Two new upper bounds for codes of distance 3.
Algebraic Coding 1993: 253-262 |
| 11 | | Heikki O. Hämäläinen,
Iiro S. Honkala,
Markku K. Kaikkonen,
Simon Litsyn:
Bounds for Binary Multiple Covering Codes.
Des. Codes Cryptography 3(3): 251-275 (1993) |
| 10 | | Mario Blaum,
Simon Litsyn,
Vincent Buskens,
Henk C. A. van Tilborg:
Error-correcting codes with bounded running digital sum.
IEEE Transactions on Information Theory 39(1): 216- (1993) |
| 1992 |
|---|
| 9 | | Gérard D. Cohen,
Simon Litsyn,
Antoine Lobstein,
Gilles Zémor:
Algebraic Coding, First French-Soviet Workshop, Paris, France, July 22-24, 1991, Proceedings
Springer 1992 |
| 8 | EE | Gérard D. Cohen,
Simon Litsyn:
On the covering radius of Reed-Muller codes.
Discrete Mathematics 106-107: 147-155 (1992) |
| 1991 |
|---|
| 7 | | Simon Litsyn:
Fast Algorithms for Decoding Orthogonal and Related Codes.
AAECC 1991: 39-47 |
| 6 | | Alexei E. Ashikhmin,
Simon Litsyn:
A Fast Search for the Maximum Element of the Fourier Spectrum.
Algebraic Coding 1991: 134-141 |
| 5 | | Gérard D. Cohen,
Simon Litsyn,
H. F. Mattson Jr.:
On Perfect Weighted Coverings with Small Radius.
Algebraic Coding 1991: 32-41 |
| 4 | | Gerhard J. M. van Wee,
Gérard D. Cohen,
Simon Litsyn:
A note on perfect multiple covetings of the Hamming space.
IEEE Transactions on Information Theory 37(3): 678- (1991) |
| 3 | | Alexander Barg,
Simon Litsyn:
DC-constrained codes from Hadamard matrices.
IEEE Transactions on Information Theory 37(3): 801-807 (1991) |
| 2 | | Gérard D. Cohen,
Simon Litsyn:
DC-constrained error-correcting codes with small running digital sum.
IEEE Transactions on Information Theory 37(3): 949- (1991) |
| 1986 |
|---|
| 1 | | Simon Litsyn,
Michael A. Tsfasman:
A note on lower bounds.
IEEE Transactions on Information Theory 32(5): 705- (1986) |
