Simon Litsyn

4.5k total citations
155 papers, 2.7k citations indexed

About

Simon Litsyn is a scholar working on Electrical and Electronic Engineering, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Simon Litsyn has authored 155 papers receiving a total of 2.7k indexed citations (citations by other indexed papers that have themselves been cited), including 127 papers in Electrical and Electronic Engineering, 99 papers in Artificial Intelligence and 62 papers in Computer Networks and Communications. Recurrent topics in Simon Litsyn's work include Coding theory and cryptography (88 papers), graph theory and CDMA systems (75 papers) and Advanced Wireless Communication Techniques (51 papers). Simon Litsyn is often cited by papers focused on Coding theory and cryptography (88 papers), graph theory and CDMA systems (75 papers) and Advanced Wireless Communication Techniques (51 papers). Simon Litsyn collaborates with scholars based in Israel, United States and France. Simon Litsyn's co-authors include Eran Sharon, Alexei Ashikhmin, Vladimir Shevelev, Uri Erez, Ram Zamir, Ilia Krasikov, Jacob Goldberger, Gérard Cohen, Iiro Honkala and Gerhard Wunder and has published in prestigious journals such as IEEE Transactions on Information Theory, Physical Review A and IEEE Journal on Selected Areas in Communications.

In The Last Decade

Simon Litsyn

144 papers receiving 2.5k citations

Peers

Countries citing papers authored by Simon Litsyn

Since Specialization

Citations

This map shows the geographic impact of Simon Litsyn's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Simon Litsyn with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Simon Litsyn more than expected).

Fields of papers citing papers by Simon Litsyn

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Simon Litsyn. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Simon Litsyn. The network helps show where Simon Litsyn may publish in the future.

Co-authorship network of co-authors of Simon Litsyn

This figure shows the co-authorship network connecting the top 25 collaborators of Simon Litsyn. A scholar is included among the top collaborators of Simon Litsyn based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Simon Litsyn. Simon Litsyn is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Design of non-binary quasi-cyclic LDPC codes by ACE optimization 2013 ·arXiv (Cornell University) ·(unknown), (unknown), Simon Litsyn	12
2	Breaking the epsilon-Soundness Bound of the Linearity Test over Gf(2) 2010 ·SIAM Journal on Control and Optimization ·(unknown), Simon Litsyn, (unknown)	0
3	Convergence Analysis of Serial Message-Passing Schedules for LDPC Decoding 2006 ·Eran Sharon, Simon Litsyn, Jacob Goldberger	5
4	Upper bounds on the rate of LDPC codes as a function of minimum distance 2006 ·IEEE Transactions on Information Theory ·Yael Ben‐Haim, Simon Litsyn	14
5	On the peak-to-average power ratio of M-sequences 2005 ·Finite Fields and Their Applications ·(unknown), Simon Litsyn, (unknown)	2
6	Lattices Which Are Good for (Almost) Everything 2005 ·IEEE Transactions on Information Theory ·Uri Erez, Simon Litsyn, Ram Zamir	218
7	Intersecting codes and separating codes 2003 ·Discrete Applied Mathematics ·(unknown), (unknown), Simon Litsyn, Hans Georg Schaathun	15
8	Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori 2003 ·Discrete Applied Mathematics ·Iiro Honkala, Mark G. Karpovsky, Simon Litsyn	9
9	Generalized hashing and parent-identifying codes 2003 ·Journal of Combinatorial Theory Series A ·Noga Alon, Gérard Cohen, Michael Krivelevich, Simon Litsyn	20
10	Bounds on identifying codes 2001 ·Discrete Mathematics ·(unknown), Iiro Honkala, Simon Litsyn	49
11	Short Dominating Paths and Cycles in the Binary Hypercube 2001 ·Annals of Combinatorics ·(unknown), Iiro Honkala, Mark G. Karpovsky, Simon Litsyn	4
12	Binary B2-Sequences : A New Upper Bound 2001 ·Journal of Combinatorial Theory Series A ·Gérard Cohen, Simon Litsyn, Gilles Zémor	20
13	The smallest covering code of length 8 and radius 2 has 12 words. 1999 ·Ars Combinatoria ·(unknown), Simon Litsyn	1
14	Several new lower bounds for football pool systems. 1998 ·Ars Combinatoria ·(unknown), Simon Litsyn	0
15	On the covering radius of an unrestricted code as a function of the rate and dual distance 1998 ·Discrete Applied Mathematics ·Simon Litsyn, Patrick Solé, René Struik	2
16	Tiling Hamming Space with Few Spheres 1997 ·Journal of Combinatorial Theory Series A ·Henk D. L. Hollmann, János Körner, Simon Litsyn	2
17	Linear Programming Bounds for Codes of Small Size 1997 ·European Journal of Combinatorics ·Ilia Krasikov, Simon Litsyn	1
18	On Integral Zeros of Krawtchouk Polynomials 1996 ·Journal of Combinatorial Theory Series A ·Ilia Krasikov, Simon Litsyn	37
19	Upper Bounds on the Covering Radius of a Code with a Given Dual Distance 1996 ·European Journal of Combinatorics ·Simon Litsyn, Aimo Tietäväinen	9
20	On the covering radius of Reed-Muller codes 1992 ·Discrete Mathematics ·Gérard Cohen, Simon Litsyn	18

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact