default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon Litsyn
Person information
- affiliation: Tel Aviv University, Israel
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2017
[j109]Noam Presman, Simon Litsyn:
Recursive descriptions of polar codes. Adv. Math. Commun. 11(1): 1-65 (2017)- 2016
- [j108]Noam Presman
, Ofer Shapira, Simon Litsyn:
Mixed-Kernels Constructions of Polar Codes. IEEE J. Sel. Areas Commun. 34(2): 239-253 (2016) - 2015
- [j107]Noam Presman, Ofer Shapira, Simon Litsyn, Tuvi Etzion, Alexander Vardy:
Binary Polarization Kernels From Code Decompositions. IEEE Trans. Inf. Theory 61(5): 2227-2239 (2015) - 2014
- [i10]Noam Presman, Ofer Shapira, Simon Litsyn, Tuvi Etzion, Alexander Vardy:
Binary Polarization Kernels from Code Decompositions. CoRR abs/1410.8433 (2014) - 2013
- [j106]Gerhard Wunder, Robert F. H. Fischer, Holger Boche, Simon Litsyn, Jong-Seon No:
The PAPR Problem in OFDM Transmission: New Directions for a Long-Lasting Problem. IEEE Signal Process. Mag. 30(6): 130-144 (2013) - [c42]Alex Bazarsky, Noam Presman, Simon Litsyn:
Design of non-binary quasi-cyclic LDPC codes by ACE optimization. ITW 2013: 1-5 - [p1]Simon Litsyn:
Polar codes. Handbook of Finite Fields 2013: 741-740 - [i9]Alex Bazarsky, Noam Presman, Simon Litsyn:
Design of Non-Binary Quasi-Cyclic LDPC Codes by ACE Optimization. CoRR abs/1304.7487 (2013) - 2012
- [j105]Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn:
A model for OFDM signals with applications. Trans. Emerg. Telecommun. Technol. 23(8): 742-748 (2012) - [j104]Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn:
An Analytical Approach to the Calculation of EVM in Clipped Multi-Carrier Signals. IEEE Trans. Commun. 60(5): 1371-1380 (2012) - [c41]Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn:
A Model for OFDM Signals with Applications. EW 2012 - [i8]Noam Presman, Simon Litsyn:
Recursive Descriptions of Decoding Algorithms and Hardware Architectures for Polar Codes. CoRR abs/1209.4818 (2012) - [i7]Gerhard Wunder, Robert F. H. Fischer, Holger Boche, Simon Litsyn, Jong-Seon No:
The PAPR Problem in OFDM Transmission: New Directions for a Long-Lasting Problem. CoRR abs/1212.2865 (2012) - 2011
- [j103]Vladimir M. Blinovsky, Simon Litsyn:
New Asymptotic Bounds on the Size of Multiple Packings of the Euclidean Sphere. Discret. Comput. Geom. 46(4): 626-635 (2011) - [j102]Igal Kotzer, Simon Litsyn:
On the EVM computation of arbitrary clipped multi-carrier signals. EURASIP J. Adv. Signal Process. 2011: 36 (2011) - [j101]Gerhard Wunder, Robert F. H. Fischer, Simon Litsyn, Jong-Seon No:
Precoding and Transmitter-Side processing techniques for multiuser MIMO OFDM systems with special emphasis on the PAPR problem. EURASIP J. Adv. Signal Process. 2011: 59 (2011) - [c40]Noam Presman, Ofer Shapira, Simon Litsyn:
Polar codes with mixed kernels. ISIT 2011: 6-10 - [c39]Noam Presman, Ofer Shapira, Simon Litsyn:
Binary polar code kernels from code decompositions. ISIT 2011: 179-183 - [c38]Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn:
On the EVM of sequences. ISIT 2011: 484-488 - [c37]Yuval Cassuto, Simon Litsyn:
Symbol-pair codes: Algebraic constructions and asymptotic bounds. ISIT 2011: 2348-2352 - [i6]Noam Presman, Ofer Shapira, Simon Litsyn:
Binary Polar Code Kernels from Code Decompositions. CoRR abs/1101.0764 (2011) - [i5]Noam Presman, Ofer Shapira, Simon Litsyn:
Polar Codes with Mixed Kernels. CoRR abs/1107.0478 (2011) - 2010
- [j100]Vladimir M. Blinovsky, Uri Erez, Simon Litsyn:
Weight distribution moments of random linear/coset codes. Des. Codes Cryptogr. 57(2): 127-138 (2010) - [j99]Tali Kaufman, Simon Litsyn, Ning Xie:
Breaking the Epsilon-Soundness Bound of the Linearity Test over GF(2). SIAM J. Comput. 39(5): 1988-2003 (2010) - [j98]Noga Alon, Simon Litsyn, Alexander Shpunt:
Typical peak sidelobe level of binary sequences. IEEE Trans. Inf. Theory 56(1): 545-554 (2010)
2000 – 2009
- 2009
- [j97]Eran Sharon, Noam Presman, Simon Litsyn:
Convergence analysis of generalized serial message-passing schedules. IEEE J. Sel. Areas Commun. 27(6): 1013-1024 (2009) - [c36]Eran Sharon, Omer Fainzilber, Simon Litsyn:
Decreasing error floor in LDPC codes by parity-check matrix extensions. ISIT 2009: 374-378 - [c35]Vladimir M. Blinovsky, Simon Litsyn:
New asymptotic bounds on the size of list codes on Euclidean sphere. ISIT 2009: 1244-1247 - [c34]Eran Sharon, Noam Presman, Simon Litsyn:
Analysis of LDPC decoding schedules. ISIT 2009: 1669-1673 - 2008
- [j96]Idan Alrod, Simon Litsyn, Alexander A. Yudin:
On PMEPR of algebraic codes. Eur. Trans. Telecommun. 19(7): 773-779 (2008) - [j95]Simon Litsyn, Alexander Shpunt:
On the Distribution of Boolean Function Nonlinearity. SIAM J. Discret. Math. 23(1): 79-95 (2008) - [j94]Eran Sharon, Simon Litsyn:
Constructing LDPC codes by error minimization progressive edge growth. IEEE Trans. Commun. 56(3): 359-368 (2008) - [j93]Yael Ben-Haim, Simon Litsyn:
Improved Upper Bounds on the Reliability Function of the Gaussian Channel. IEEE Trans. Inf. Theory 54(1): 5-12 (2008) - [j92]Christine Bachoc, Yael Ben-Haim, Simon Litsyn:
Bounds for Codes in Products of Spaces, Grassmann, and Stiefel Manifolds. IEEE Trans. Inf. Theory 54(3): 1024-1035 (2008) - [c33]Tali Kaufman, Simon Litsyn, Ning Xie:
Breaking the epsilon-Soundness Bound of the Linearity Test over GF(2). APPROX-RANDOM 2008: 498-511 - [c32]Noam Presman, Eran Sharon, Simon Litsyn:
Efficient layers-based schedules for iterative decoding of LDPC codes. ISIT 2008: 1148-1152 - [c31]Simon Litsyn, Alexander Shpunt:
Typical peak sidelobe level of binary sequences. ISIT 2008: 1755-1757 - [i4]Tali Kaufman, Simon Litsyn, Ning Xie:
Breaking the ε-Soundness Bound of the Linearity Test over GF(2). Sublinear Algorithms 2008 - 2007
- [b2]Simon Litsyn:
Peak power control in multicarrier communications. Cambridge University Press 2007, ISBN 978-0-521-85596-9, pp. I-XIII, 1-278 - [j91]Yael Ben-Haim, Simon Litsyn:
A new upper bound on the rate of non-binary codes. Adv. Math. Commun. 1(1): 83-92 (2007) - [j90]Beniamin Mounits, Tuvi Etzion, Simon Litsyn:
New upper bounds on codes via association schemes and linear programming. Adv. Math. Commun. 1(2): 173-195 (2007) - [j89]Simon Litsyn, Beniamin Mounits:
Improved lower bounds on sizes of single-error correcting codes. Des. Codes Cryptogr. 42(1): 67-72 (2007) - [j88]Daniel Levin, Eran Sharon, Simon Litsyn:
Lazy scheduling forLDPC decoding. IEEE Commun. Lett. 11(1): 70-72 (2007) - [j87]Simon Litsyn, Alexander Shpunt:
A Balancing Method for PMEPR Reduction in OFDM Signals. IEEE Trans. Commun. 55(4): 683-691 (2007) - [j86]Shay Freundlich, David Burshtein, Simon Litsyn:
Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity. IEEE Trans. Inf. Theory 53(4): 1484-1494 (2007) - [j85]Eran Sharon, Simon Litsyn, Jacob Goldberger:
Efficient Serial Message-Passing Schedules for LDPC Decoding. IEEE Trans. Inf. Theory 53(11): 4076-4091 (2007) - [c30]Christine Bachoc, Yael Ben-Haim, Simon Litsyn:
Bounds for Codes in the Grassmann Manifold. ISIT 2007: 1796-1800 - [i3]Tali Kaufman, Simon Litsyn, Ning Xie:
Breaking the ε-Soundness Bound of the Linearity Test over GF(2). Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j84]Idan Alrod, Simon Litsyn, Alexander A. Yudin:
On the peak-to-average power ratio of M-sequences. Finite Fields Their Appl. 12(1): 139-150 (2006) - [j83]Yaniv Nana, Eran Sharon, Simon Litsyn:
Improved decoding of LDPC coded modulations. IEEE Commun. Lett. 10(5): 375-377 (2006) - [j82]Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn:
EXIT Functions for Binary Input Memoryless Symmetric Channels. IEEE Trans. Commun. 54(7): 1207-1214 (2006) - [j81]Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn:
Analysis of Low-Density Parity-Check Codes Based on EXIT Functions. IEEE Trans. Commun. 54(7): 1349-1349 (2006) - [j80]Eran Sharon, Alexei E. Ashikhmin, Simon Litsyn:
Analysis of low-density parity-check codes based on EXIT functions. IEEE Trans. Commun. 54(8): 1407-1414 (2006) - [j79]Simon Litsyn, Gerhard Wunder:
Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design. IEEE Trans. Inf. Theory 52(3): 992-1006 (2006) - [j78]Yael Ben-Haim, Simon Litsyn:
Upper bounds on the rate of LDPC codes as a function of minimum distance. IEEE Trans. Inf. Theory 52(5): 2092-2100 (2006) - [j77]Shraga I. Bross, Simon Litsyn:
Improved Upper Bounds for Codes With Unequal Error Protection. IEEE Trans. Inf. Theory 52(7): 3329-3333 (2006) - [c29]Tali Kaufman, Simon Litsyn:
Long Extended BCH Codes Are Spanned by Minimum Weight Words. AAECC 2006: 285-294 - [c28]Yael Ben-Haim, Simon Litsyn:
A New Upper Bound on the Rate of Non-Binary Codes. ISIT 2006: 297-301 - [c27]Yael Ben-Haim, Simon Litsyn:
Improved Upper Bounds on the Reliability Function of the Gaussian Channel. ISIT 2006: 709-713 - [c26]Shay Freundlich, David Burshtein, Simon Litsyn:
Approximately Lower Triangular Ensembles of LPDC Codes with Linear Encoding Complexity. ISIT 2006: 821-825 - [c25]Eran Sharon, Simon Litsyn:
A Method for Constructing LDPC Codes with Low Error Floor. ISIT 2006: 2569-2573 - 2005
- [b1]Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Antoine Lobstein:
Covering Codes. North-Holland mathematical library 54, North-Holland 2005, ISBN 978-0-444-82511-7, pp. I-XXI, 1-542 - [j76]Yael Ben-Haim, Simon Litsyn:
Exact Minimum Density of Codes Identifying Vertices in the Square Grid. SIAM J. Discret. Math. 19(1): 69-82 (2005) - [j75]Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn:
Bounds on distance distributions in codes of known size. IEEE Trans. Inf. Theory 51(1): 250-258 (2005) - [j74]Simon Litsyn, Alexander A. Yudin:
Discrete and continuous maxima in multicarrier communication. IEEE Trans. Inf. Theory 51(3): 919-928 (2005) - [j73]Uri Erez, Simon Litsyn, Ram Zamir:
Lattices which are good for (almost) everything. IEEE Trans. Inf. Theory 51(10): 3401-3416 (2005) - [j72]Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron:
Testing Reed-Muller codes. IEEE Trans. Inf. Theory 51(11): 4032-4039 (2005) - [c24]Tali Kaufman, Simon Litsyn:
Almost Orthogonal Linear Codes are Locally Testable. FOCS 2005: 317-326 - [c23]Yael Ben-Haim, Simon Litsyn:
Upper bounds on the rate of LDPC codes as a function of minimum distance. ISIT 2005: 47-51 - [c22]Shraga I. Bross, Simon Litsyn:
Improved upper bounds for codes with unequal error protection. ISIT 2005: 790-794 - [c21]Beniamin Mounits, Tuvi Etzion, Simon Litsyn:
New upper bounds on A(n, d). ISIT 2005: 921-925 - [i2]Beniamin Mounits, Tuvi Etzion, Simon Litsyn:
New Upper Bounds on A(n,d). CoRR abs/cs/0508107 (2005) - 2004
- [j71]Gregory Freiman, Simon Litsyn, Alexander A. Yudin:
A method to suppress high peaks in BPSK-modulated OFDM signal. IEEE Trans. Commun. 52(9): 1440-1443 (2004) - [j70]Alexei E. Ashikhmin, Simon Litsyn:
Simple MAP Decoding of First-Order Reed-Muller and Hamming Codes. IEEE Trans. Inf. Theory 50(8): 1812-1818 (2004) - [c20]Simon Litsyn, Gerhard Wunder:
Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design. ISIT 2004: 389 - [c19]Gregory Freiman, Simon Litsyn, Alexander A. Yudin:
On signals with very high peak-to-average power ratio. ISIT 2004: 422 - [c18]Eran Sharon, Alexei Ashikhmin, Simon Litsyn:
EXIT functions for binary memoryless symmetric channels. ISIT 2004: 441 - [c17]Alexei Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn:
Bounds on distance distributions in codes of known size. ISIT 2004: 486 - 2003
- [j69]Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun:
Intersecting Codes and Separating Codes. Discret. Appl. Math. 128(1): 75-83 (2003) - [j68]Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn:
Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori. Discret. Appl. Math. 129(2-3): 409-419 (2003) - [j67]Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun:
Erratum to "Intersecting codes and separating codes": [Discrete Applied Mathematics 128 (2003) 75-83]. Discret. Appl. Math. 131(3): 689-690 (2003) - [j66]Noga Alon, Simon Litsyn, Raphael Yuster:
A Coding Theory Bound and Zero-Sum Square Matrices. Graphs Comb. 19(4): 449-457 (2003) - [j65]Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn:
Generalized hashing and parent-identifying codes. J. Comb. Theory A 104(1): 207-215 (2003) - [j64]Simon Litsyn, Vladimir Shevelev:
Distance distributions in ensembles of irregular low-density parity-check codes. IEEE Trans. Inf. Theory 49(12): 3140-3159 (2003) - [c16]Simon Litsyn, Alexander Shpunt:
On the capacity of two-dimensional weight-constrained memories. Algebraic Coding Theory and Information Theory 2003: 121-132 - [c15]Alexei Ashikhmin, Simon Litsyn:
Simple MAP decoding of first order Reed-Muller and Hamming codes. ITW 2003: 18-21 - [c14]Gerhard Wunder, Simon Litsyn:
On the statistical distribution of the crest-factor of codes in OFDM transmission. ITW 2003: 191-194 - [c13]Uri Erez, Simon Litsyn, Ram Zamir:
Lattices which are good for (almost) everything. ITW 2003: 271-274 - [c12]Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron:
Testing Low-Degree Polynomials over GF(2(. RANDOM-APPROX 2003: 188-199 - 2002
- [j63]Beniamin Mounits, Tuvi Etzion, Simon Litsyn:
Improved upper bounds on sizes of codes. IEEE Trans. Inf. Theory 48(4): 880-886 (2002) - [j62]Simon Litsyn, Vladimir Shevelev:
On ensembles of low-density parity-check codes: Asymptotic distance distributions. IEEE Trans. Inf. Theory 48(4): 887-908 (2002) - [j61]David Burshtein, Michael Krivelevich, Simon Litsyn, Gadi Miller:
Upper bounds on the rate of LDPC Codes. IEEE Trans. Inf. Theory 48(9): 2437-2449 (2002) - 2001
- [j60]Ilia Krasikov, Simon Litsyn:
On the Distance Distributions of BCH Codes and Their Duals. Des. Codes Cryptogr. 23(2): 223-232 (2001) - [j59]Uri Blass, Iiro S. Honkala, Simon Litsyn:
Bounds on identifying codes. Discret. Math. 241(1-3): 119-128 (2001) - [j58]Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
Estimates of the Distance Distribution of Codes and Designs. Electron. Notes Discret. Math. 6: 4-14 (2001) - [j57]Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn:
Intersecting codes and partially identifying codes. Electron. Notes Discret. Math. 6: 211-219 (2001) - [j56]Gérard D. Cohen, Simon Litsyn, Gilles Zémor:
Binary B2-Sequences : A New Upper Bound. J. Comb. Theory A 94(1): 152-155 (2001) - [j55]Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
Estimates of the distance distribution of codes and designs. IEEE Trans. Inf. Theory 47(3): 1050-1061 (2001) - [j54]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 Trans. Inf. Theory 47(4): 1596-1598 (2001) - [c11]Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn:
On the Identification of Vertices and Edges Using Cycles. AAECC 2001: 308-314 - [c10]Gérard D. Cohen, Simon Litsyn, Gilles Zémor:
Binary Codes for Collusion-Secure Fingerprinting. ICISC 2001: 178-185 - [e3]Alexander Barg, Simon Litsyn:
Codes and Association Schemes, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, November 9-12, 1999. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 56, DIMACS/AMS 2001, ISBN 978-0-8218-2074-2 [contents] - 2000
- [j53]Ilia Krasikov, Simon Litsyn:
An improved upper bound on the minimum distance of doubly-even self-dual codes. IEEE Trans. Inf. Theory 46(1): 274-278 (2000) - [j52]Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn:
Quantum error detection I: Statement of the problem. IEEE Trans. Inf. Theory 46(3): 778-788 (2000) - [j51]Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn:
Quantum error detection II: Bounds. IEEE Trans. Inf. Theory 46(3): 789-800 (2000) - [j50]Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
A new upper bound on the reliability function of the Gaussian channel. IEEE Trans. Inf. Theory 46(6): 1945-1961 (2000)
1990 – 1999
- 1999
- [j49]Uri Blass, Simon Litsyn:
The smallest covering code of length 8 and radius 2 has 12 words. Ars Comb. 52 (1999) - [j48]Tero Laihonen, Simon Litsyn:
New Bounds On Covering Radius as a Function of Dual Distance. SIAM J. Discret. Math. 12(2): 243-251 (1999) - [j47]Ilia Krasikov, Simon Litsyn:
On the Distance Distribution of Duals of BCH Codes. IEEE Trans. Inf. Theory 45(1): 247-250 (1999) - [j46]Osnat Keren, Simon Litsyn:
More on the Distance Distribution of BCH Codes. IEEE Trans. Inf. Theory 45(1): 251-255 (1999) - [j45]Simon Litsyn:
New Upper Bounds on Error Exponents. IEEE Trans. Inf. Theory 45(2): 385-398 (1999) - [j44]Alexei E. Ashikhmin, Simon Litsyn:
Upper Bounds on the Size of Quantum Codes. IEEE Trans. Inf. Theory 45(4): 1206-1215 (1999) - [j43]Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
New Upper Bounds on Generalized Weights. IEEE Trans. Inf. Theory 45(4): 1258-1263 (1999) - [j42]Gregory Freiman, Simon Litsyn:
Asymptotically exact bounds on the size of high-order spectral-null codes. IEEE Trans. Inf. Theory 45(6): 1798-1807 (1999) - [j41]Alexei E. Ashikhmin, Iiro S. Honkala, Tero Laihonen, Simon Litsyn:
On relations between covering radius and dual distance. IEEE Trans. Inf. Theory 45(6): 1808-1816 (1999) - [j40]Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn:
On binary constructions of quantum codes. IEEE Trans. Inf. Theory 45(7): 2495-2498 (1999) - [c9]Uri Blass, Iiro S. Honkala, Simon Litsyn:
On tHe Size of Identifying Codes. AAECC 1999: 142-147 - [c8]Ilia Krasikov, Simon Litsyn:
Survey of binary Krawtchouk polynomials. Codes and Association Schemes 1999: 199-211 - [c7]Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
Estimates of the distance distribution of nonbinary codes, with applications. Codes and Association Schemes 1999: 287-301 - [i1]Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
Polynomial method in coding and information theory. CoRR math.CO/9910175 (1999) - 1998
- [j39]Uri Blass, Simon Litsyn:
Several new lower bounds for football pool systems. Ars Comb. 50 (1998) - [j38]Simon Litsyn, Patrick Solé, René Struik:
On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual Distance. Discret. Appl. Math. 82(1-3): 177-191 (1998) - [j37]Ilia Krasikov, Simon Litsyn:
Bounds on Spectra of Codes with Known Dual Distance. Des. Codes Cryptogr. 13(3): 285-297 (1998) - [j36]Tero Laihonen, Simon Litsyn:
On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes. Des. Codes Cryptogr. 14(1): 71-80 (1998) - [j35]Osnat Keren, Simon Litsyn:
Codes Correcting Phased Burst Erasures. IEEE Trans. Inf. Theory 44(1): 416-420 (1998) - [j34]Uri Blass, Simon Litsyn:
Several New Lower Bounds on the Size of Codes with Covering Radius One. IEEE Trans. Inf. Theory 44(5): 1998-2002 (1998) - 1997
- [j33]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) - [j32]Iiro S. Honkala, Tero Laihonen, Simon Litsyn:
On Covering Radius and Discrete Chebyshev Polynomials. Appl. Algebra Eng. Commun. Comput. 8(5): 395-401 (1997) - [j31]Ilia Krasikov, Simon Litsyn:
Linear Programming Bounds for Codes of Small Size. Eur. J. Comb. 18(6): 647-656 (1997) - [j30]Henk D. L. Hollmann, János Körner, Simon Litsyn:
Tiling Hamming Space with Few Spheres. J. Comb. Theory A 80(2): 388-393 (1997) - [j29]Ilia Krasikov, Simon Litsyn:
Estimates for the range of binomiality in codes' spectra. IEEE Trans. Inf. Theory 43(3): 987-991 (1997) - [j28]Ilia Krasikov, Simon Litsyn:
Linear programming bounds for doubly-even self-dual codes. IEEE Trans. Inf. Theory 43(4): 1238-1244 (1997) - [j27]Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Patrick Solé:
Long packing and covering codes. IEEE Trans. Inf. Theory 43(5): 1617-1619 (1997) - [j26]Françoise Levy-dit-Vehel, Simon Litsyn:
Parameters of Goppa codes revisited. IEEE Trans. Inf. Theory 43(6): 1811-1819 (1997) - [j25]Osnat Keren, Simon Litsyn:
A class of array codes correcting multiple column erasures. IEEE Trans. Inf. Theory 43(6): 1843-1851 (1997) - 1996
- [j24]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) - [j23]Alexei E. Ashikhmin, Simon Litsyn:
Fast Decoding Algorithms for First Order Reed-Muller and Related Codes. Des. Codes Cryptogr. 7(3): 187-214 (1996) - [j22]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) - [j21]Ilia Krasikov, Simon Litsyn:
On Integral Zeros of Krawtchouk Polynomials. J. Comb. Theory A 74(1): 71-99 (1996) - [j20]Gérard D. Cohen, Simon Litsyn, Alexander Vardy, Gilles Zémor:
Tilings of Binary Spaces. SIAM J. Discret. Math. 9(3): 393-412 (1996) - [j19]Françoise Levy-dit-Vehel, Simon Litsyn:
More on the covering radius of BCH codes. IEEE Trans. Inf. Theory 42(3): 1023-1028 (1996) - [j18]Gérard D. Cohen, Simon Litsyn, Gilles Zémor:
On the traveling salesman problem in binary Hamming spaces. IEEE Trans. Inf. Theory 42(4): 1274-1276 (1996) - [j17]Gérard D. Cohen, Simon Litsyn, Gilles Zémor:
On greedy algorithms in coding theory. IEEE Trans. Inf. Theory 42(6): 2053-2057 (1996) - 1995
- [j16]Yaron Klein, Simon Litsyn, Alexander Vardy:
Two New Bounds on the Size of Binary Codes with a Minimum Distance of Three. Des. Codes Cryptogr. 6(3): 219-227 (1995) - [j15]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. Discret. Math. 8(2): 196-207 (1995) - [j14]Ilia Krasikov, Simon Litsyn:
On spectra of BCH codes. IEEE Trans. Inf. Theory 41(3): 786-788 (1995) - [j13]Ilia Krasikov, Simon Litsyn:
On the accuracy of the binomial approximation to the distance distribution of codes. IEEE Trans. Inf. Theory 41(5): 1472-1474 (1995) - [j12]Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, H. F. Mattson Jr.:
Weighted coverings and packings. IEEE Trans. Inf. Theory 41(6): 1856-1867 (1995) - [c6]Iiro S. Honkala, Simon Litsyn, Aimo Tietäväinen:
On Algebraic Methods in Covering Radius Problems. AAECC 1995: 21-32 - [c5]Françoise Levy-dit-Vehel, Simon Litsyn:
On the Covering Radius of Long Goppa Codes. AAECC 1995: 341-346 - 1994
- [j11]Simon Litsyn, Aimo Tietäväinen:
Character Sum Constructions of Constrained Error-Correcting Codes. Appl. Algebra Eng. Commun. Comput. 5: 45-51 (1994) - [j10]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) - [j9]Simon Litsyn, Alexander Vardy:
The uniqueness of the Best code. IEEE Trans. Inf. Theory 40(5): 1693-1698 (1994) - [j8]Gérard D. Cohen, Simon Litsyn, Gilles Zémor:
Upper bounds on generalized distances. IEEE Trans. Inf. Theory 40(6): 2090-2092 (1994) - 1993
- [j7]Heikki O. Hämäläinen, Iiro S. Honkala, Markku K. Kaikkonen, Simon Litsyn:
Bounds for Binary Multiple Covering Codes. Des. Codes Cryptogr. 3(3): 251-275 (1993) - [j6]Mario Blaum, Simon Litsyn, Vincent Buskens, Henk C. A. van Tilborg:
Error-correcting codes with bounded running digital sum. IEEE Trans. Inf. Theory 39(1): 216-227 (1993) - [c4]Simon Litsyn, Alexander Vardy:
Two new upper bounds for codes of distance 3. Algebraic Coding 1993: 253-262 - [e2]Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor:
Algebraic Coding, First French-Israeli Workshop, Paris, France, July 19-21, 1993, Proceedings. Lecture Notes in Computer Science 781, Springer 1993, ISBN 3-540-57843-9 [contents] - 1992
- [j5]Gérard D. Cohen, Simon Litsyn:
On the covering radius of Reed-Muller codes. Discret. Math. 106-107: 147-155 (1992) - [e1]Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor:
Algebraic Coding, First French-Soviet Workshop, Paris, France, July 22-24, 1991, Proceedings. Lecture Notes in Computer Science 573, Springer 1992, ISBN 3-540-55130-1 [contents] - 1991
- [j4]Gerhard J. M. van Wee, Gérard D. Cohen, Simon Litsyn:
A note on perfect multiple covetings of the Hamming space. IEEE Trans. Inf. Theory 37(3): 678-682 (1991) - [j3]Alexander Barg, Simon Litsyn:
DC-constrained codes from Hadamard matrices. IEEE Trans. Inf. Theory 37(3): 801-807 (1991) - [j2]Gérard D. Cohen, Simon Litsyn:
DC-constrained error-correcting codes with small running digital sum. IEEE Trans. Inf. Theory 37(3): 949-955 (1991) - [c3]Simon Litsyn:
Fast Algorithms for Decoding Orthogonal and Related Codes. AAECC 1991: 39-47 - [c2]Gérard D. Cohen, Simon Litsyn, H. F. Mattson Jr.:
On Perfect Weighted Coverings with Small Radius. Algebraic Coding 1991: 32-41 - [c1]Alexei E. Ashikhmin, Simon Litsyn:
A Fast Search for the Maximum Element of the Fourier Spectrum. Algebraic Coding 1991: 134-141
1980 – 1989
- 1986
- [j1]Simon Litsyn, Michael A. Tsfasman:
A note on lower bounds. IEEE Trans. Inf. Theory 32(5): 705-706 (1986)
Coauthor Index
Alexei E. Ashikhmin
aka: Alexei Ashikhmin
aka: Alexei Ashikhmin
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
