default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuther D. Rudolph
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 1988
[j17]Jiapeng Gao, Luther D. Rudolph, Carlos R. P. Hartmann:
Iteratively maximum likelihood decodable spherical codes and a method for their construction. IEEE Trans. Inf. Theory 34(3): 480-485 (1988)- 1983
- [j16]K. H. Farrell, Luther D. Rudolph, Carlos R. P. Hartmann, L. D. Nielsen:
Decoding by local optimization. IEEE Trans. Inf. Theory 29(5): 740-743 (1983) - 1980
- [j15]Sumit Dasgupta, Carlos R. P. Hartmann, Luther D. Rudolph:
Dual-Mode Logic for Function-Independent Fault Testing. IEEE Trans. Computers 29(11): 1025-1029 (1980) - 1979
- [j14]Luther D. Rudolph, Carlos R. P. Hartmann, Tai-Yang Hwang, Nguyen Duc:
Algebraic analog decoding of linear binary codes. IEEE Trans. Inf. Theory 25(4): 430-440 (1979) - 1977
- [j13]Carlos R. P. Hartmann, Luther D. Rudolph, Kishan G. Mehrotra:
Asymptotic performance of optimum bit-by-bit decoding for the white Gaussian channel (Corresp.). IEEE Trans. Inf. Theory 23(4): 520-522 (1977) - 1976
- [j12]Carlos R. P. Hartmann, Luther D. Rudolph:
An optimum symbol-by-symbol decoding rule for linear codes. IEEE Trans. Inf. Theory 22(5): 514-517 (1976) - 1974
- [j11]Woodrow E. Robbins, Luther D. Rudolph:
On Two-Level Exclusive-or Majority Networks. IEEE Trans. Computers 23(1): 34-41 (1974) - [j10]Carlos R. P. Hartmann, James B. Ducey, Luther D. Rudolph:
On the structure of generalized finite-geometry codes. IEEE Trans. Inf. Theory 20(2): 240-252 (1974) - [j9]J. R. Riek, Carlos R. P. Hartmann, Luther D. Rudolph:
Majority decoding of some classes of binary cyclic codes. IEEE Trans. Inf. Theory 20(5): 637-643 (1974) - 1973
- [j8]Luther D. Rudolph, Carlos R. P. Hartmann:
Decoding by sequential code reduction. IEEE Trans. Inf. Theory 19(4): 549-555 (1973) - 1972
- [j7]Alexander Miczo, Luther D. Rudolph:
A Relationship Between Output Symbol Occurrence Rate and Observability of Autonomous Machines. IEEE Trans. Computers 21(8): 911-913 (1972) - [j6]Luther D. Rudolph, Woodrow E. Robbins:
One-step weighted-majority decoding (Corresp.). IEEE Trans. Inf. Theory 18(3): 446-448 (1972) - 1970
- [j5]Alexander Miczo, Luther D. Rudolph:
A note on the free distance of a convolutional code (Corresp.). IEEE Trans. Inf. Theory 16(5): 646-648 (1970) - [j4]Luther D. Rudolph:
Generalized threshold decoding of convolutional codes. IEEE Trans. Inf. Theory 16(6): 739-745 (1970) - 1969
- [j3]Luther D. Rudolph:
Threshold decoding of cyclic codes. IEEE Trans. Inf. Theory 15(3): 414-418 (1969) - 1967
- [j2]Luther D. Rudolph:
A class of majority logic decodable codes (Corresp.). IEEE Trans. Inf. Theory 13(2): 305-307 (1967) - 1964
- [j1]Luther D. Rudolph, M. E. Mitchell:
Implementation of decoders for cyclic codes (Corresp.). IEEE Trans. Inf. Theory 10(3): 259-260 (1964)
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:49 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:
