default search action
Richard E. Blahut
Person information
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [c12]Soumya Jana, Richard E. Blahut:
Vanishing criteria in multiterminal source coding. CISS 2010: 1-6 - [c11]Richard E. Blahut, Soumya Jana:
Körner-Marton theorem for binary modulo-two sum problem from canonical equations. ISITA 2010: 406-409
2000 – 2009
- 2008
- [j17]Jeong Woo Lee, Rüdiger L. Urbanke, Richard E. Blahut:
Turbo Codes in Binary Erasure Channel. IEEE Trans. Inf. Theory 54(4): 1765-1773 (2008) - [c10]Soumya Jana, Richard E. Blahut:
Partial side information problem: Equivalence of two inner bounds. CISS 2008: 1005-1009 - [c9]Soumya Jana, Richard E. Blahut:
Canonical description for multiterminal source coding. ISIT 2008: 697-701 - 2007
- [j16]Jeong Woo Lee, Rüdiger L. Urbanke, Richard E. Blahut:
On the performance of turbo codes over the binary erasure channel. IEEE Commun. Lett. 11(1): 67-69 (2007) - [j15]Jeong Woo Lee, Richard E. Blahut:
Convergence Analysis and BER Performance of Finite-Length Turbo Codes. IEEE Trans. Commun. 55(5): 1033-1043 (2007) - [j14]Zhijun Zhao, Richard E. Blahut:
On the Asymptotic Consistency of Minimum Divergence and Least-Squares Principles. IEEE Trans. Inf. Theory 53(9): 3283-3287 (2007) - 2006
- [c8]Zhijun Zhao, Richard E. Blahut:
On the I-divergence Demodulation of the Nonnegative Impulse Response ISI Channel. ICC 2006: 2969-2975 - [c7]Soumya Jana, Richard E. Blahut:
Insight into Source/Channel Duality and More based on an Intuitive Covering/Packing Lemma. ISIT 2006: 2329-2333 - [c6]Negar Kiyavash, Richard E. Blahut:
On Capacity of a Constrained Two-Dimensional Channel in Presence of Violations. ISIT 2006: 2423-2427 - 2005
- [c5]Patricio Parada, Richard E. Blahut:
Secrecy capacity of SIMO and slow fading channels. ISIT 2005: 2152-2155 - 2004
- [j13]Jeong Woo Lee, Richard E. Blahut:
Lower bound on BER of finite-length turbo codes based on EXIT characteristics. IEEE Commun. Lett. 8(4): 238-240 (2004) - [c4]Zhijun Zhao, Richard E. Blahut:
Space diversity for the multimode optical fiber channel. ISIT 2004: 335 - 2003
- [c3]Jeong Woo Lee, Richard E. Blahut:
Generalized EXIT chart and BER analysis of finite-length turbo codes. GLOBECOM 2003: 2067-2072 - [c2]Jeong Woo Lee, Richard E. Blahut:
Bit error rate estimate of finite length codes. ICC 2003: 2728-2732 - 2001
- [c1]Jonathan B. Ashbrook, Naresh R. Shanbhag, Ralf Koetter, Richard E. Blahut:
Implementation of a Hermitian decoder IC in 0.35 μm CMOS. CICC 2001: 297-300
1990 – 1999
- 1998
- [j12]William Weeks IV, Richard E. Blahut:
The Capacity and Coding Gain of Certain Checkerboard Codes. IEEE Trans. Inf. Theory 44(3): 1193-1203 (1998) - [j11]Joseph A. O'Sullivan, Richard E. Blahut, Donald L. Snyder:
Information-Theoretic Image Formation. IEEE Trans. Inf. Theory 44(6): 2094-2123 (1998) - 1992
- [j10]Richard E. Blahut:
A note on binary cyclic codes of blocklength 63. Discret. Math. 106-107: 35-43 (1992) - 1991
- [j9]Richard E. Blahut:
The Gleason-Prange theorem. IEEE Trans. Inf. Theory 37(5): 1269-1273 (1991)
1980 – 1989
- 1985
- [j8]Richard E. Blahut:
Algebraic fields, signal processing, and error control. Proc. IEEE 73(5): 874-893 (1985) - 1984
- [j7]Richard E. Blahut:
A Universal Reed-Solomon Decoder. IBM J. Res. Dev. 28(2): 150-158 (1984)
1970 – 1979
- 1979
- [j6]Richard E. Blahut:
Transform Techniques for Error Control Codes. IBM J. Res. Dev. 23(3): 299-315 (1979) - 1977
- [j5]Richard E. Blahut:
Composition bounds for channel block codes. IEEE Trans. Inf. Theory 23(6): 656-674 (1977) - 1976
- [j4]Richard E. Blahut:
Information bounds of the Fano-Kullback type. IEEE Trans. Inf. Theory 22(4): 410-421 (1976) - 1974
- [j3]Richard E. Blahut:
Hypothesis testing and information theory. IEEE Trans. Inf. Theory 20(4): 405-417 (1974) - 1973
- [j2]Richard E. Blahut:
An hypothesis-testing approach to information theory (Ph.D. Thesis abstr.). IEEE Trans. Inf. Theory 19(2): 253 (1973) - 1972
- [j1]Richard E. Blahut:
Computation of channel capacity and rate-distortion functions. IEEE Trans. Inf. Theory 18(4): 460-473 (1972)
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-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint