Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
This map shows the geographic impact of Shu Lin'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 Shu Lin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Shu Lin more than expected).
This network shows the impact of papers produced by Shu Lin. 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 Shu Lin. The network helps show where Shu Lin may publish in the future.
Co-authorship network of co-authors of Shu Lin
This figure shows the co-authorship network connecting the top 25 collaborators of Shu Lin.
A scholar is included among the top collaborators of Shu Lin 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 Shu Lin. Shu Lin is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Li, Juane, et al.. (2016). Reed-Solomon based nonbinary LDPC codes. International Symposium on Information Theory and its Applications. 384–388.1 indexed citations
3.
Li, Juane, Shu Lin, Khaled Abdel-Ghaffar, W.E. Ryan, & Daniel J. Costello. (2016). Globally coupled LDPC codes. 1–10.22 indexed citations
Kasami, Tadao, et al.. (1998). A sufficient condition for ruling out some useless test error patterns in iterative decoding algorithms. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 81(2). 321–326.10 indexed citations
9.
Morelos-Zaragoza, Robert, et al.. (1998). Coded Modulation for Satellite Broadcasting Based on Unconventional Partitionings. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 81(10). 2055–2063.7 indexed citations
10.
Morelos-Zaragoza, Robert, et al.. (1997). Error Performance of Multilevel Block Coded 8-PSK Modulations Using Unequal Error Protection Codes for the Rayleigh Fading Channel. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 80(6). 1143–1149.1 indexed citations
11.
Kasami, Tadao, et al.. (1994). On branch labels of parallel components of the L-section minimal trellis diagrams for binary linear block codes. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 77(6). 1058–1068.7 indexed citations
12.
Lin, Shu, et al.. (1994). On the Labeling of Minimal Trellises for Linear Block Codes. International Symposium on Information Theory and its Applications. 33.2 indexed citations
13.
Kasami, Tadao, et al.. (1993). On Structural Complexity of the L-Section Minimal Trellis Diagrams for Binary Linear Block Codes (Special Section on Information Theory and Its Applications). IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 76(9). 1411–1421.13 indexed citations
Costello, Daniel J., et al.. (1990). Multi-level trellis coded modulation and multi-stage decoding.2 indexed citations
16.
Lin, Shu. (1990). Multi-level modulation codes and multi-stage decoding. NASA STI Repository (National Aeronautics and Space Administration). 91. 11953.3 indexed citations
Lin, Shu. (1987). Bandwidth efficient block codes for M-ary PSK modulation. NASA Technical Reports Server (NASA). 88. 12712.1 indexed citations
19.
Lin, Shu, et al.. (1986). Two hybrid ARQ error control schemes for near Earth satellite communications. NASA STI Repository (National Aeronautics and Space Administration).1 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.