Lloyd R. Welch
#3,688
Most Influential Person Now
American information theorist
Lloyd R. Welch's AcademicInfluence.com Rankings
Lloyd R. Welchcomputer-science Degrees
Computer Science
#743
World Rank
#766
Historical Rank
#402
USA Rank
Information Theory
#10
World Rank
#11
Historical Rank
#7
USA Rank
Download Badge
Computer Science
Lloyd R. Welch's Degrees
- PhD Electrical Engineering Stanford University
- Masters Electrical Engineering Stanford University
- Bachelors Electrical Engineering University of California, Berkeley
Why Is Lloyd R. Welch Influential?
(Suggest an Edit or Addition)According to Wikipedia, Lloyd Richard Welch is an American information theorist and applied mathematician, and co-inventor of the Baum–Welch algorithm and the Berlekamp–Welch algorithm, also known as the Welch–Berlekamp algorithm.
Lloyd R. Welch's Published Works
Published Works
- Lower bounds on the maximum cross correlation of signals (Corresp.) (1974) (1429)
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities (1977) (416)
- Generalized Bent Functions and Their Properties (1985) (405)
- Bent-function sequences (1982) (270)
- Perfect Codes in the Lee Metric and the Packing of Polyominoes (1970) (222)
- Slant Transform Image Coding (1974) (200)
- Comma-Free Codes (1958) (159)
- Weight distributions of the cosets of the (32, 6) Reed-Muller code (1972) (155)
- GMW sequences (Corresp.) (1984) (130)
- Continued fractions and Berlekamp's algorithm (1979) (99)
- GMW sequences (1984) (93)
- Group characters: Sequences with good correlation properties (1978) (42)
- The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions (1978) (40)
- The genus of K12s (1967) (28)
- The fast decoding of Reed-Solomon codes using Fermat transforms (Corresp.) (1978) (23)
- CONSTRUCTION AND PROPERTIES OF COMMA-FREE CODES (2015) (19)
- A low-rate improvement on the Elias bound (Corresp.) (1974) (17)
- On the Enumeration of Polygons (1960) (16)
- Coding for Optical Channels With Photon-Counting (1979) (14)
- Solution of the heawood map-coloring problem—Case 4 (1970) (13)
- On the Independence of Quadratic Expressions (1963) (13)
- NONLINEAR SHIFT-REGISTER SEQUENCES (1957) (11)
- CYCLES FROM NONLINEAR SHIFT REGISTERS (1959) (11)
- Erasure decoding in burst-error channels (1981) (9)
- A transform decoder for Reed-Solomon codes in multiple-user communication systems (1977) (8)
- The fast decoding of Reed-Solomon codes using number theoretic transforms (1976) (7)
- Mechanization of codes with bounded synchronization delays (1970) (7)
- Permanents of 0, 1-Matrices (1974) (7)
- The genus of $K_n ,n = 12s$ (1965) (6)
- The genus of $K_n ,n = 12\left( {2^m } \right)$ (1965) (5)
- Totally Variant Sets in Finite Groups and Vector Spaces (1968) (4)
- ON THE FACTORIZATION OF TRINOMIALS OVER GF 2 (1959) (4)
- Minimum-weight codewords in the (128,64) BCH (1977) (4)
- Elementary Problems: E2611-E2616 (1976) (2)
- Coding for optical channels with photon-counting. [deep space network] (1979) (2)
- Advanced Communication Techniques (1988) (1)
- Spectral Shaping Without Subcarriers (1978) (1)
- The rearrangement of functions and maximization of a convolution integral (1958) (1)
- Correcting a specified set of likely error patterns (1994) (1)
- A co-designed coding, modulation and equalization scheme for the transmission of 155-52 Mbit/s data over a 72 MHz intelsat transponder. Part 2: Equalization (1993) (0)
- On the Blizard Decoding Algorithm (1971) (0)
- Research on Optical Image Processing (1972) (0)
- Information systems - A program for finite Fourier transforms (1966) (0)
- On a Class of Codes of Delsarte (1976) (0)
- The Generation of PseudoRandom Numbers for the Simulation of White Gaussian Noise (2001) (0)
- Research in Communication Theory (1976) (0)
- A class of F-ary convolutional codes for finite state ISI channels (1998) (0)
- Walsh transforms and signal detection (1977) (0)
- A co-designed decision feedback equalizer, deinterleaver and decoder (1991) (0)
- A new spectral shaping scheme without subcarriers (1995) (0)
- Use of hidden Markov chain models for evaluating and selecting codes for fading channels and erasure prediction decoding co-operated with interleaver and HMC (1991) (0)
- Elementary Problems: E2641-E2646 (1977) (0)
- PN Signal Acquisition and Convolution Via the Characters of the Additive Group (2003) (0)
- GMW (Gordon, Mills, and Welch) Sequences, (1984) (0)
- Concatenated shift registers generating maximally spaced phase shifts of PN-sequences (1977) (0)
This paper list is powered by the following services:
Other Resources About Lloyd R. Welch
What Schools Are Affiliated With Lloyd R. Welch?
Lloyd R. Welch is affiliated with the following schools: