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

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author						Papers	Cites
Simon Litsyn	1.8k	1.5k	1.2k	562	257	155	2.7k
Alexander Barg	1.1k 0.6×	1.8k 1.2×	1.5k 1.3×	736 1.3×	321 1.2×	148	2.8k
Torleiv Kløve	1.5k 0.8×	925 0.6×	1.6k 1.4×	396 0.7×	172 0.7×	124	2.0k
Ron M. Roth	1.1k 0.6×	1.3k 0.9×	1.6k 1.4×	974 1.7×	313 1.2×	126	2.5k
Victor K. Wei	1.7k 0.9×	1.0k 0.7×	2.0k 1.7×	587 1.0×	217 0.8×	70	3.0k
Tuvi Etzion	1.5k 0.8×	1.2k 0.8×	1.7k 1.4×	679 1.2×	269 1.0×	170	2.4k
Michael Langberg	1.2k 0.7×	1.6k 1.1×	523 0.4×	421 0.7×	147 0.6×	139	2.1k
D.K. Ray-Chaudhuri	1.1k 0.6×	541 0.4×	1.0k 0.9×	442 0.8×	85 0.3×	61	1.8k
Gennian Ge	1.6k 0.9×	553 0.4×	1.6k 1.4×	600 1.1×	174 0.7×	211	2.4k
Joachim Rosenthal	539 0.3×	559 0.4×	756 0.6×	506 0.9×	82 0.3×	120	1.6k
Gilles Zémor	715 0.4×	748 0.5×	861 0.7×	348 0.6×	178 0.7×	91	1.6k

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

Litsyn, Simon, et al.. (2013). Design of non-binary quasi-cyclic LDPC codes by ACE optimization. arXiv (Cornell University). 1–5. 12 indexed citations

Litsyn, Simon, et al.. (2010). Breaking the epsilon-Soundness Bound of the Linearity Test over Gf(2). SIAM Journal on Control and Optimization.

Sharon, Eran, Simon Litsyn, & Jacob Goldberger. (2006). Convergence Analysis of Serial Message-Passing Schedules for LDPC Decoding. 1–6. 5 indexed citations

Sharon, Eran, Alexei Ashikhmin, & Simon Litsyn. (2006). Analysis of Low-Density Parity-Check Codes Based on EXIT Functions. IEEE Transactions on Communications. 54(7). 1349–1349. 22 indexed citations

Litsyn, Simon, et al.. (2005). On the peak-to-average power ratio of M-sequences. Finite Fields and Their Applications. 12(1). 139–150. 2 indexed citations

Honkala, Iiro, Mark G. Karpovsky, & Simon Litsyn. (2003). Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori. Discrete Applied Mathematics. 129(2-3). 409–419. 9 indexed citations

Alon, Noga, Gérard Cohen, Michael Krivelevich, & Simon Litsyn. (2003). Generalized hashing and parent-identifying codes. Journal of Combinatorial Theory Series A. 104(1). 207–215. 20 indexed citations

Litsyn, Simon, et al.. (2003). Intersecting codes and separating codes. Discrete Applied Mathematics. 128(1). 75–83. 15 indexed citations

Honkala, Iiro, et al.. (2001). Bounds on identifying codes. Discrete Mathematics. 241(1-3). 119–128. 49 indexed citations

10.

Cohen, Gérard, Simon Litsyn, & Gilles Zémor. (2001). Binary B2-Sequences : A New Upper Bound. Journal of Combinatorial Theory Series A. 94(1). 152–155. 20 indexed citations

11.

Honkala, Iiro, et al.. (2001). Short Dominating Paths and Cycles in the Binary Hypercube. Annals of Combinatorics. 5(1). 51–59. 4 indexed citations

12.

Litsyn, Simon, et al.. (1999). The smallest covering code of length 8 and radius 2 has 12 words.. Ars Combinatoria. 52. 1 indexed citations

13.

Litsyn, Simon, et al.. (1998). Several new lower bounds for football pool systems.. Ars Combinatoria. 50.

14.

Litsyn, Simon, Patrick Solé, & René Struik. (1998). On the covering radius of an unrestricted code as a function of the rate and dual distance. Discrete Applied Mathematics. 82(1-3). 177–191. 2 indexed citations

15.

Hollmann, Henk D. L., János Körner, & Simon Litsyn. (1997). Tiling Hamming Space with Few Spheres. Journal of Combinatorial Theory Series A. 80(2). 388–393. 2 indexed citations

16.

Krasikov, Ilia & Simon Litsyn. (1997). Linear Programming Bounds for Codes of Small Size. European Journal of Combinatorics. 18(6). 647–656. 1 indexed citations

17.

Litsyn, Simon & Aimo Tietäväinen. (1996). Upper Bounds on the Covering Radius of a Code with a Given Dual Distance. European Journal of Combinatorics. 17(2-3). 265–270. 9 indexed citations

18.

Krasikov, Ilia & Simon Litsyn. (1996). On Integral Zeros of Krawtchouk Polynomials. Journal of Combinatorial Theory Series A. 74(1). 71–99. 37 indexed citations

19.

Litsyn, Simon, et al.. (1996). . Designs Codes and Cryptography. 7(3). 187–214. 7 indexed citations

20.

Cohen, Gérard & Simon Litsyn. (1992). On the covering radius of Reed-Muller codes. Discrete Mathematics. 106-107. 147–155. 18 indexed citations

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