Simon Litsyn

Professor

1982 …2020

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • A constant energy constellation OFDM signal model with applications

    Kotzer, I., Har-Nevo, S., Sodin, S. & Litsyn, S., 2012, 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012. 6376994. (2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • A fast search for the maximum element of the Fourier spectrum

    Ashikhmin, A. E. & Litsyn, S. N., 1992, Algebraic Coding - 1st French-Soviet Workshop, Proceedings. Cohen, G., Lobstein, A., Zemor, G. & Litsyn, S. (eds.). Springer Verlag, p. 134-141 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 573 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Algebraic Coding: First French-Soviet Workshop Paris, July 22-24, 1991 Proceedings

    Cohen, G., Litsyn, S., Lobstein, A. & Zémor, G., 1992, Algebraic Coding - 1st French-Soviet Workshop, Proceedings. Litsyn, S., Cohen, G., Lobstein, A. & Zemor, G. (eds.). Springer Verlag, (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 573 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Almost orthogonal linear codes are locally testable

    Kaufman, T. & Litsyn, S., 2005, Proceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005. p. 317-326 10 p. 1530724. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2005).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • A lower bound on the probability of decoding error over a BSC channel

    Keren, O. & Litsyn, S., 2000, 21st IEEE Convention of the Electrical and Electronic Engineers in Israel, Proceedings. Institute of Electrical and Electronics Engineers Inc., p. 271-273 3 p. 924389. (21st IEEE Convention of the Electrical and Electronic Engineers in Israel, Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • A method for constructing LDPC codes with low error floor

    Sharon, E. & Litsyn, S., 2006, Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006. p. 2569-2573 5 p. 4036436. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Analysis of LDPC decoding schedules

    Sharon, E., Presman, N. & Litsyn, S., 2009, 2009 IEEE International Symposium on Information Theory, ISIT 2009. p. 1669-1673 5 p. 5205776. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • An analytical approach to the calculation of EVM in clipped OFDM Signals

    Kotzer, I., Har-Nevo, S., Sodin, S. & Litsyn, S., 2010, 2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010. p. 193-197 5 p. 5661957. (2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • A new upper bound on the rate of non-binary codes

    Ben-Haim, Y. & Litsyn, S., 2006, Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006. p. 297-301 5 p. 4035970. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • A new upper bound on the reliability function of the Gaussian channel

    Ashikhmin, A., Barg, A. & Litsyn, S., 1999, Proceedings of the 1999 IEEE Information Theory and Communications Workshop. Swarts, F. & Swarts, J. (eds.). Institute of Electrical and Electronics Engineers Inc., p. 103 1 p. 781434. (Proceedings of the 1999 IEEE Information Theory and Communications Workshop).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Approximately lower triangular ensembles of LPDC codes with linear encoding complexity

    Freundlich, S., Burshtein, D. & Litsyn, S., 2006, Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006. p. 821-825 5 p. 4036078. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Binary codes for collusion-secure fingerprinting

    Cohen, G., Litsyn, S. & Zémor, G., 2002, Information Security and Cryptology - ICISC 2001 - 4th International Conference, Proceedings. Kim, K. (ed.). Springer Verlag, p. 178-185 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2288).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Binary polar code kernels from code decompositions

    Presman, N., Shapira, O. & Litsyn, S., 2011, 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011. p. 179-183 5 p. 6033859. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Bounds for codes in the Grassmann manifold

    Bachoc, C., Ben-Haim, Y. & Litsyn, S., 2006, 2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI. p. 25-29 5 p. 4115238. (IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Bounds for codes in the Grassmann manifold

    Bachoc, C., Ben-Haim, Y. & Litsyn, S., 2007, Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007. p. 1796-1800 5 p. 4557482. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Breaking the ε-soundness bound of the linearity test over GF(2)

    Kaufman, T., Litsyn, S. & Xie, N., 2008, Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings. p. 498-511 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5171 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Convergence analysis of serial message-passing schedules for LDPC decoding

    Sharon, E., Litsyn, S. & Goldberger, J., 2006, TURBO - CODING 2006 - 4th International Symposium on Turbo Codes and Related Topics and 6th International ITG-Conference on Source and Channel Coding. VDE Verlag GmbH, (TURBO - CODING 2006 - 4th International Symposium on Turbo Codes and Related Topics and 6th International ITG-Conference on Source and Channel Coding).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Convergence analysis of serial message-passing schedules for LDPC decoding

    Sharon, E., Litsyn, S. & Goldberger, J., 2006, Turbo Codes and Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on. Institute of Electrical and Electronics Engineers Inc., 5755867. (Turbo Codes and Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Covering radius and discrete Chebyshev polynomials

    Honkala, I., Laihonen, T. & Litsyn, S., 1997, Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997. p. 365 1 p. 613300. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • DC-constrained error correcting codes with small running digital sum

    Cohen, G. D. & Litsyn, S. N., 1991, Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991. Institute of Electrical and Electronics Engineers Inc., p. 259 1 p. 695315. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Decreasing error floor in LDPC codes by parity-check matrix extensions

    Fainzilber, O., Sharon, E. & Litsyn, S., 2009, 2009 IEEE International Symposium on Information Theory, ISIT 2009. p. 374-378 5 p. 5205738. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Design of non-binary quasi-cyclic LDPC codes by ACE optimization

    Bazarsky, A., Presman, N. & Litsyn, S., 2013, 2013 IEEE Information Theory Workshop, ITW 2013. 6691250. (2013 IEEE Information Theory Workshop, ITW 2013).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Efficient layers-based schedules for iterative decoding of LDPC codes

    Presman, N., Sharon, E. & Litsyn, S., 2008, Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008. p. 1148-1152 5 p. 4595167. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Fast algorithms for decoding orthogonal and related codes

    Litsyn, S. N., 1991, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 9th International Symposium, AAECC, Proceedings, 1991. Rao, T. R. N., Mattson, H. F. & Mora, T. (eds.). Springer Verlag, p. 39-47 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 539 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Generalized serial schedules for iterative decoding of LDPC codes

    Presman, N., Sharon, E. & Litsyn, S., 2008, 2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008. p. 105-109 5 p. 4736667. (IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Generating good finite length ldpc codes based on lifted graphs

    Sharon, E. & Litsyn, S., 2006, 44th Annual Allerton Conference on Communication, Control, and Computing 2006. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, p. 41-50 10 p. (44th Annual Allerton Conference on Communication, Control, and Computing 2006; vol. 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Improved estimates on covering radius

    Ashikhmin, A., Honkala, I., Laihonen, T. & Litsyn, S., 1999, Proceedings of the 1999 IEEE Information Theory and Communications Workshop. Swarts, F. & Swarts, J. (eds.). Institute of Electrical and Electronics Engineers Inc., p. 123 1 p. 781454. (Proceedings of the 1999 IEEE Information Theory and Communications Workshop).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Improved upper bounds on the reliability function of the gaussian channel

    Ben-Haim, Y. & Litsyn, S., 2006, Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006. p. 709-713 5 p. 4036055. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Lattices which are good for (almost) everything

    Erez, U., Litsyn, S. & Zamir, R., 2003, Proceedings - 2003 IEEE Information Theory Workshop, ITW 2003. Institute of Electrical and Electronics Engineers Inc., p. 271-274 4 p. 1216746. (Proceedings - 2003 IEEE Information Theory Workshop, ITW 2003).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Long extended BCH codes are spanned by minimum weight words

    Kaufman, T. & Litsyn, S., 2006, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 16th International Symposium, AAECC-16, Proceedings. p. 285-294 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3857 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • New asymptotic bounds on the size of list codes on euclidean sphere

    Blinovsky, V. & Litsyn, S., 2009, 2009 IEEE International Symposium on Information Theory, ISIT 2009. p. 1244-1247 4 p. 5205969. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • New upper bounds on the covering radius of codes with known dual distance

    Litsyn, S., Soldé, P. & Tietäväinen, A., 1994, Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994. p. 304 1 p. 394714. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On algebraic methods in covering radius problems

    Honkala, I., Litsyn, S. & Tietäväinen, A., 1995, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 11th International Symposium, AAECC, Proceedings. Cohen, G., Giusti, M. & Mora, T. (eds.). Springer Verlag, p. 21-32 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 948).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On binary constructions of quantum codes

    Cohen, G. D., Encheva, S. B. & Litsyn, S., 1999, Proceedings of the 1999 IEEE Information Theory and Communications Workshop. Swarts, F. & Swarts, J. (eds.). Institute of Electrical and Electronics Engineers Inc., p. 127 1 p. 781458. (Proceedings of the 1999 IEEE Information Theory and Communications Workshop).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On generalized distances

    Cohen, G., Litsyn, S. & Zémor, G., 1994, Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994. p. 309 1 p. 394709. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On perfect weighted coverings with small radius

    Cohen, G. D., Litsyn, S. N. & Mattson, H. F., 1992, Algebraic Coding - 1st French-Soviet Workshop, Proceedings. Cohen, G., Lobstein, A., Zemor, G. & Litsyn, S. (eds.). Springer Verlag, p. 32-41 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 573 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On the covering radius of long Goppa codes

    Levy-dit-Vehel, F. & Litsyn, S., 1995, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 11th International Symposium, AAECC, Proceedings. Cohen, G., Giusti, M. & Mora, T. (eds.). Springer Verlag, p. 341-346 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 948).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On the distance distribution of BCH codes

    Keren, O. & Litsyn, S., 1998, Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998. p. 463 1 p. 709068. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On the distance distribution of duals of BCH codes

    Krasikov, I. & Litsyn, S., 1998, Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998. p. 435 1 p. 709040. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On the EVM of sequences

    Kotzer, I., Har-Nevo, S., Sodin, S. & Litsyn, S., 2011, 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011. p. 484-488 5 p. 6034174. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On the identification of vertices and edges using cycles

    Honkala, I., Karpovsky, M. G. & Litsyn, S., 2001, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 14th International Symposium, AAECC-14, Proceedings. Boztas, S. & Shparlinski, I. E. (eds.). Springer Verlag, p. 308-314 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2227).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On the peak-to-average power ratio of M-sequences

    Alrod, I. & Litsyn, S., 2002, 22nd Convention of Electrical and Electronics Engineers in Israel, Proceedings. Institute of Electrical and Electronics Engineers Inc., p. 23 1 p. 1178300. (IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings; vol. 2002-January).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On the size of identifying codes

    Blass, U., Honkala, I. & Litsyn, S., 1999, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 13th International Symposium, AAECC-13, Proceedings. Fossorier, M., Lin, S., Imai, H. & Poli, A. (eds.). Springer Verlag, p. 142-147 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1719).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On the statistical distribution of the crest-factor of codes in OFDM transmission

    Wunder, G. & Litsyn, S., 2003, Proceedings - 2003 IEEE Information Theory Workshop, ITW 2003. Institute of Electrical and Electronics Engineers Inc., p. 191-194 4 p. 1216727. (Proceedings - 2003 IEEE Information Theory Workshop, ITW 2003).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On upper bounds for the achievable rates of LDPC codes

    Presman, N. & Litsyn, S., 7 Dec 2009, 2009 IEEE Information Theory Workshop, ITW 2009. p. 21-25 5 p. 5351232. (2009 IEEE Information Theory Workshop, ITW 2009).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On upper bounds for the distance of codes of small size

    Krasikov, I. & Litsyn, S., 1997, Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997. p. 84 1 p. 612999. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Perfect tilings of binary spaces

    Cohen, G., Litsyn, S., Vardy, A. & Zemor, G., 1993, Proceedings of the 1993 IEEE International Symposium on Information Theory. Publ by IEEE, p. 370 1 p. (Proceedings of the 1993 IEEE International Symposium on Information Theory).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Polar codes with mixed kernels

    Presman, N., Shapira, O. & Litsyn, S., 2011, 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011. p. 6-10 5 p. 6034223. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Puncturing, expurgating and expanding the q-ary BCH based robust codes

    Admaty, N., Litsyn, S. & Keren, O., 2012, 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012. 6376995. (2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Simple MAP decoding of first order Reed-Muller and Hamming codes

    Ashikhmin, A. & Litsyn, S., 2003, Proceedings - 2003 IEEE Information Theory Workshop, ITW 2003. Institute of Electrical and Electronics Engineers Inc., p. 18-21 4 p. 1216684. (Proceedings - 2003 IEEE Information Theory Workshop, ITW 2003).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review