default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLloyd R. Welch
Person information
- affiliation: University of Southern California, Los Angeles, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[c1]Lloyd R. Welch:
The Generation of PseudoRandom Numbers for the Simulation of White Gaussian Noise. SETA 2001: 319-324
1990 – 1999
- 1995
- [j17]N. L. Tan, Lloyd R. Welch, Robert A. Scholtz:
Correcting a specified set of likely error patterns. IEEE Trans. Inf. Theory 41(1): 272-279 (1995)
1980 – 1989
- 1985
- [j16]P. Vijay Kumar, Robert A. Scholtz, Lloyd R. Welch:
Generalized Bent Functions and Their Properties. J. Comb. Theory A 40(1): 90-107 (1985) - 1984
- [j15]Robert A. Scholtz, Lloyd R. Welch:
GMW sequences. IEEE Trans. Inf. Theory 30(3): 548- (1984) - 1982
- [j14]John Douglas Olsen, Robert A. Scholtz, Lloyd R. Welch:
Bent-function sequences. IEEE Trans. Inf. Theory 28(6): 858-864 (1982) - 1981
- [j13]Kon S. Leung, Lloyd R. Welch:
Erasure decoding in burst-error channels. IEEE Trans. Inf. Theory 27(2): 160-167 (1981)
1970 – 1979
- 1979
- [j12]Lloyd R. Welch, Robert A. Scholtz:
Continued fractions and Berlekamp's algorithm. IEEE Trans. Inf. Theory 25(1): 19-27 (1979) - 1978
- [j11]Irving S. Reed, Robert A. Scholtz, Trieu-Kien Truong, Lloyd R. Welch:
The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions. IEEE Trans. Inf. Theory 24(1): 100-106 (1978) - [j10]Irving S. Reed, Trieu-Kien Truong, Lloyd R. Welch:
The fast decoding of Reed-Solomon codes using Fermat transforms (Corresp.). IEEE Trans. Inf. Theory 24(4): 497-499 (1978) - [j9]Robert A. Scholtz, Lloyd R. Welch:
Group characters: Sequences with good correlation properties. IEEE Trans. Inf. Theory 24(5): 537-545 (1978) - 1977
- [j8]Robert J. McEliece, Eugene R. Rodemich, Howard Rumsey Jr., Lloyd R. Welch:
New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities. IEEE Trans. Inf. Theory 23(2): 157-166 (1977) - [j7]Hideo Murakami, Irving S. Reed, Lloyd R. Welch:
A transform decoder for Reed-Solomon codes in multiple-user communication systems. IEEE Trans. Inf. Theory 23(6): 675-683 (1977) - 1974
- [j6]Basil Gordon, Theodore S. Motzkin, Lloyd R. Welch:
Permanents of 0, 1-Matrices. J. Comb. Theory A 17(2): 145-155 (1974) - [j5]William K. Pratt, Wen-Hsiung Chen, Lloyd R. Welch:
Slant Transform Image Coding. IEEE Trans. Commun. 22(8): 1075-1093 (1974) - [j4]Lloyd R. Welch:
Lower bounds on the maximum cross correlation of signals (Corresp.). IEEE Trans. Inf. Theory 20(3): 397-399 (1974) - [j3]Lloyd R. Welch, Robert J. McEliece, Howard Rumsey Jr.:
A low-rate improvement on the Elias bound (Corresp.). IEEE Trans. Inf. Theory 20(5): 676-678 (1974) - 1972
- [j2]Elwyn R. Berlekamp, Lloyd R. Welch:
Weight distributions of the cosets of the (32, 6) Reed-Muller code. IEEE Trans. Inf. Theory 18(1): 203-207 (1972) - 1970
- [j1]Robert A. Scholtz, Lloyd R. Welch:
Mechanization of codes with bounded synchronization delays. IEEE Trans. Inf. Theory 16(4): 438-446 (1970)
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-06-10 21:20 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:
