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.
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
1998886 citationsSergio Benedetto, D. Divsalar et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of F. Pollara'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 F. Pollara with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites F. Pollara more than expected).
This network shows the impact of papers produced by F. Pollara. 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 F. Pollara. The network helps show where F. Pollara may publish in the future.
Co-authorship network of co-authors of F. Pollara
This figure shows the co-authorship network connecting the top 25 collaborators of F. Pollara.
A scholar is included among the top collaborators of F. Pollara 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 F. Pollara. F. Pollara 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.
Andrews, K., et al.. (2001). Turbo-Decoder Implementation for the Deep Space Network. 148. 1–20.8 indexed citations
2.
Dolinar, S., et al.. (2000). Stopping Rules for Turbo Decoders. 142. 1.59 indexed citations
3.
Dolinar, S., D. Divsalar, Jon Hamkins, & F. Pollara. (2000). Capacity of Pulse-Position Modulation (PPM) on Gaussian and Webb Channels. NASA Technical Reports Server (NASA). 142. 1–31.67 indexed citations
4.
Benedetto, Sergio, G. Montorsi, D. Divsalar, & F. Pollara. (1996). Soft-Output Decoding Algorithms in Iterative Decoding of Turbo Codes. NASA Technical Reports Server (NASA). 124. 63–87.103 indexed citations
5.
Kiely, Aaron & F. Pollara. (1995). A Seismic Data Compression System Using Subband Coding. NASA Technical Reports Server (NASA). 121. 242–251.8 indexed citations
6.
Divsalar, D., S. Dolinar, F. Pollara, & Robert J. McEliece. (1995). Transfer function bounds on the performance of turbo codes. 122. 44–55.151 indexed citations
7.
Pollara, F. & D. Divsalar. (1992). Cascaded convolutional codes. NASA Technical Reports Server (NASA). 110. 202–207.3 indexed citations
8.
Pollara, F., et al.. (1991). Integer cosine transform for image compression. Telecommunications and Data Acquisition Progress Report. 105. 45–53.6 indexed citations
9.
Dolinar, S., et al.. (1991). Compressed/reconstructed test images for CRAF/Cassini. NASA STI Repository (National Aeronautics and Space Administration). 104. 88–97.2 indexed citations
10.
Pollara, F. & S. R. Arnold. (1991). Emerging standards for still image compression: A software implementation and simulation study. 104. 98–102.2 indexed citations
11.
Dolinar, S. & F. Pollara. (1990). The theoretical limits of source and channel coding. 102. 62–72.1 indexed citations
12.
Collins, O.M., S. Dolinar, Robert J. McEliece, & F. Pollara. (1990). A VLSI decomposition of the deBruijn graph. 100. 180–190.2 indexed citations
13.
Pollara, F., et al.. (1989). Performance of concatenated codes using 8-bit and 10-bit Reed-Solomon codes. NASA STI Repository (National Aeronautics and Space Administration).3 indexed citations
14.
McEliece, Robert J., et al.. (1989). Some Easily Analyzable Convolutional Codes. 99. 105–114.5 indexed citations
15.
Collins, O.M. & F. Pollara. (1989). Memory management in traceback Viterbi decoders. NASA STI Repository (National Aeronautics and Space Administration). 99. 98–104.21 indexed citations
16.
Pollara, F., et al.. (1988). Further Results On Finite-State Codes. NASA STI Repository (National Aeronautics and Space Administration). 13(10). 56–62.2 indexed citations
17.
Statman, Joseph I., et al.. (1988). A long constraint length VLSI Viterbi decoder for the DSN. Telecommunications and Data Acquisition Progress Report. 95. 134–142.17 indexed citations
18.
Pollara, F., et al.. (1988). A software simulation study of the long constraint length VLSI Viterbi decoder. Telecommunications and Data Acquisition Progress Report. 94. 210.1 indexed citations
19.
Pollara, F.. (1987). Erasure declaring Viterbi decoders. NASA STI Repository (National Aeronautics and Space Administration). 88. 47–51.2 indexed citations
20.
Pollara, F.. (1985). A software simulation study of a (255,223) Reed-Solomon encoder-decoder. NASA STI Repository (National Aeronautics and Space Administration). 85. 28192.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.