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 I.S. Reed'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 I.S. Reed with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites I.S. Reed more than expected).
This network shows the impact of papers produced by I.S. Reed. 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 I.S. Reed. The network helps show where I.S. Reed may publish in the future.
Co-authorship network of co-authors of I.S. Reed
This figure shows the co-authorship network connecting the top 25 collaborators of I.S. Reed.
A scholar is included among the top collaborators of I.S. Reed 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 I.S. Reed. I.S. Reed is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Truong, Trieu‐Kien, et al.. (2006). Fast, prime factor, discrete Fourier transform algorithms over GF (2 m ) for 8 leq m leq 10.. Information Sciences. 176. 1–26.4 indexed citations
2.
Truong, Trieu‐Kien, et al.. (1989). A simplified procedure for decoding the (23,12) and (24,12) Golay codes. Telecommunications and Data Acquisition Progress Report. 96. 49–58.2 indexed citations
3.
Truong, T. K., et al.. (1989). Decoding of 1/2-rate (24,12) Golay codes. NASA STI Repository (National Aeronautics and Space Administration). 97. 202–207.1 indexed citations
4.
Truong, T. K., et al.. (1988). A Comparison of VLSI Architectures for Time and Transform Domain Decoding of Reed-Solomon Codes. NASA STI Repository (National Aeronautics and Space Administration). 92. 63–81.3 indexed citations
5.
Truong, T. K., et al.. (1987). A comparison of VLSI architecture of finite field multipliers using dual, normal or standard basis. Telecommunications and Data Acquisition Progress Report. 90. 63–75.4 indexed citations
6.
Truong, Trieu‐Kien, et al.. (1987). A simplified procedure for correcting both errors and erasures of a Reed-Solomon code using the Euclidean algorithm. Telecommunications and Data Acquisition Progress Report. 91. 200–212.3 indexed citations
7.
Reed, I.S., et al.. (1987). On the VLSI design of a pipeline Reed-Solomon decoder using systolic arrays. NASA STI Repository (National Aeronautics and Space Administration). 91. 224–234.4 indexed citations
Yuen, J. H., et al.. (1984). A Systolic VLSI Design of a Pipeline Reed-solomon Decoder. Telecommunications and Data Acquisition Progress Report. 76. 99–113.1 indexed citations
11.
Omura, J. K., et al.. (1983). VLSI Architectures for Computing Multiplications and Inverses in GF(2m). Telecommunications and Data Acquisition Progress Report. 75. 52–64.11 indexed citations
12.
Truong, T. K., et al.. (1982). A parallel VLSI architecture for a digital filter of arbitrary length using Fermat number transforms. Telecommunications and Data Acquisition Progress Report. 70. 60–71.6 indexed citations
13.
Reed, I.S., T. K. Truong, Robert Miller, & Jianzhong Huang. (1981). Fast transforms for decoding Reed-Solomon codes. IEE Proceedings F Communications, Radar and Signal Processing. 128(1). 9–14.4 indexed citations
14.
Miller, Robert, et al.. (1979). A Reed-Solomon Decoding Program for Correcting Both Errors and Erasures. 53. 102–107.2 indexed citations
15.
Reed, I.S. & T. K. Truong. (1978). A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform. 45. 172–185.1 indexed citations
16.
Reed, I.S., et al.. (1978). On decoding of Reed-Solomon codes over GF/32/ and GF/64/ using the transform techniques of Winograd. 44. 139–171.2 indexed citations
17.
Reed, I.S., et al.. (1977). Transform Decoding of Reed-Solomon Codes Over GF (22n) Using the Techniques of Winograd. 43. 141–163.
18.
Reed, I.S., et al.. (1977). High-radix transforms for Reed-Solomon codes over Fermat primes. IEEE Transactions on Information Theory.1 indexed citations
19.
Reed, I.S., L. R. Welch, & T. K. Truong. (1976). The fast decoding of Reed-Solomon codes using number theoretic transforms. 35. 64–78.4 indexed citations
20.
Reed, I.S.. (1971). kth order near-orthogonal codes. IEEE Transactions on Information Theory. 116–117.11 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.