default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabrizio Pollara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[c5]Sam Dolinar, Kenneth S. Andrews, Fabrizio Pollara, Dariush Divsalar:
The limits of coding with joint constraints on detected and undetected error rates. ISIT 2008: 970-974- 2007
- [j10]Kenneth S. Andrews, Dariush Divsalar, Sam Dolinar, Jon Hamkins, Christopher R. Jones, Fabrizio Pollara:
The Development of Turbo and LDPC Codes for Deep-Space Applications. Proc. IEEE 95(11): 2142-2156 (2007) - 2002
- [j9]Roberto Garello
, Guido Montorsi, Sergio Benedetto, Dariush Divsalar, Fabrizio Pollara:
Labelings and encoders with the uniform bit error property with applications to serially concatenated trellis codes. IEEE Trans. Inf. Theory 48(1): 123-148 (2002) - 2001
- [j8]Dariush Divsalar, Sam Dolinar, Fabrizio Pollara:
Iterative turbo decoder analysis based on density evolution. IEEE J. Sel. Areas Commun. 19(5): 891-907 (2001) - [c4]Roberto Manduchi, Larry H. Matthies, Fabrizio Pollara:
From Cross-Country Autonomous Navigation to Intelligent Deep Space Communications: Visual Sensor Processing at JPL. ICIAP 2001: 472-477 - 2000
- [c3]Roberto Manduchi, Sam Dolinar, Fabrizio Pollara, Adina Matache:
Semantic Progressive Transmission for Deep Space Communications. Data Compression Conference 2000: 561 - [c2]Dariush Divsalar, Samuel Dolinar, Fabrizio Pollara:
Serial concatenated trellis coded modulation with rate-1 inner code. GLOBECOM 2000: 777-782
1990 – 1999
- 1998
- [j7]Sergio Benedetto, Guido Montorsi, Dariush Divsalar, Fabrizio Pollara:
Soft-input soft-output modules for the construction and distributed iterative decoding of code networks. Eur. Trans. Telecommun. 9(2): 155-172 (1998) - [j6]Sergio Benedetto, Dariush Divsalar, Guido Montorsi, Fabrizio Pollara:
Analysis, Design, and Iterative Decoding of Double Serially Concatenated Codes with Interleavers. IEEE J. Sel. Areas Commun. 16(2): 231-244 (1998) - [j5]Sergio Benedetto, Dariush Divsalar, Guido Montorsi, Fabrizio Pollara:
Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding. IEEE Trans. Inf. Theory 44(3): 909-926 (1998) - 1997
- [j4]Sergio Benedetto, Dariush Divsalar, Guido Montorsi, Fabrizio Pollara:
A soft-input soft-output APP module for iterative decoding of concatenated codes. IEEE Commun. Lett. 1(1): 22-24 (1997) - [c1]Sergio Benedetto, Dariush Divsalar, Guido Montorsi, Fabrizio Pollara:
Design of Serially Concatenated Interleaved Codes. ICC (2) 1997: 710-714 - 1992
- [j3]Oliver Collins, Sam Dolinar, Robert J. McEliece, Fabrizio Pollara:
A VLSI Decomposition of the deBruijn Graph. J. ACM 39(4): 931-948 (1992) - 1990
- [j2]Joseph H. Yuen, Marvin K. Simon, Warner Miller, Fabrizio Pollara, Carl R. Ryan, Dariush Divsalar, James C. Morakis:
Modulation and coding for satellite and space communications. Proc. IEEE 78(7): 1250-1266 (1990)
1980 – 1989
- 1988
- [j1]Fabrizio Pollara, Robert J. McEliece, Khaled A. S. Abdel-Ghaffar:
Finite-state codes. IEEE Trans. Inf. Theory 34(5): 1083-1089 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
