Robert McEliece

Q: What Schools Are Affiliated With Robert McEliece

Robert McEliece is affiliated with the following schools: California Institute of Technology, University of Illinois Urbana-Champaign

Robert McEliece's AcademicInfluence.com Rankings

Robert McEliece

Mathematics

#790

World Rank

#1422

Historical Rank

#345

USA Rank

Algebra

#96

World Rank

#161

Historical Rank

#28

USA Rank

Measure Theory

#571

World Rank

#795

Historical Rank

#237

USA Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Robert McEliece Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Robert J. McEliece was the Allen E. Puckett Professor and a professor of electrical engineering at the California Institute of Technology best known for his work in error-correcting coding and information theory. He was the 2004 recipient of the Claude E. Shannon Award and the 2009 recipient of the IEEE Alexander Graham Bell Medal. He was a life fellow of the IEEE and was elected to the National Academy of Engineering in 1998.

(See a Problem?)

Robert McEliece's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A public key cryptosystem based on algebraic coding theory (1978) (1638)
On the inherent intractability of certain coding problems (Corresp.) (1978) (1414)
Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm (1998) (1024)
The capacity of the Hopfield associative memory (1987) (914)
Theory of Information and Coding (1979) (790)
The generalized distributive law (2000) (789)
On sharing secrets and Reed-Solomon codes (1981) (649)
Finite Fields for Computer Scientists and Engineers (1986) (519)
Channels with block interference (1984) (426)
New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities (1977) (416)
On the BCJR trellis for linear block codes (1996) (252)
Channel assignment in cellular radio (1989) (241)
Transfer function bounds on the performance of turbo codes Pasadena (1995) (237)
On the decoder error probability for Reed-Solomon codes (1986) (178)
Practical codes for photon communication (1981) (167)
The Guruswami-Sudan Decoding Algorithm for Reed-Solomon Codes (2003) (114)
Dynamic channel assignment in cellular radio (1990) (108)
Weights of Irreducible Cyclic Codes (1972) (108)
Finite field for scientists and engineers (1987) (106)
The trellis complexity of convolutional codes (1995) (105)
Lower bounds on data collection time in sensory networks (2004) (105)
Coding theorems for turbo code ensembles (2002) (102)
The Lovasz bound and some generalizations (1978) (101)
Irreducible Cyclic Codes and Gauss Sums (1975) (95)
Asynchronous multiple-access channel capacity (1981) (85)
Iterative algebraic soft-decision list decoding of Reed-Solomon codes (2005) (85)
Packets distribution algorithms for sensor networks (2003) (81)
The Theory of Information and Coding: Information theory (2002) (80)
Encyclopedia of Mathematics and Its Applications: The Theory of Information and Coding: A Mathematical Framework for Communication (1984) (78)
The Generalized Distributive Law and Free Energy Minimization (2001) (78)
Weight congruences for p-ary cyclic codes (1972) (77)
Iterative decoding on graphs with a single cycle (1998) (74)
Effective free distance of turbo codes (1996) (70)
Euler products, cyclotomy, and coding☆ (1972) (68)
Efficient universal noiseless source codes (1981) (66)
Are Turbo-like Codes Effective on Nonstandard Channels?* (2001) (65)
An information theoretic study of communication in the presence of jamming (1981) (60)
On the complexity of reliable communication on the erasure channel (2001) (58)
Belief Propagation on Partially Ordered Sets (2003) (57)
A Property of Euclid’s Algorithm and an Application to Padé Approximation (1978) (56)
Performance limits for channelized cellular telephone systems (1994) (56)
Irregular Repeat – Accumulate Codes 1 (2000) (55)
The Reliability of Single-Error Protected Computer Memories (1988) (55)
Trellis decoding complexity of linear block codes (1996) (54)
Some High-Rate Near Capacity Codecs for the Gaussian Channel (1996) (52)
RA Codes Achieve AWGN Channel Capacity (1999) (50)
Enumerators for protograph ensembles of LDPC codes (2005) (47)
A note on the Griesmer bound (1973) (46)
Two-dimensional burst identification codes and their use in burst correction (1988) (45)
A VLSI decomposition of the deBruijn graph (1989) (45)
Introduction to the special issue on codes on graphs and iterative algorithms (2001) (45)
Subspace subcodes of Reed-Solomon codes (1994) (45)
Hide and Seek, Data Storage, and Entropy (1971) (44)
The Rényi redundancy of generalized Huffman codes (1988) (43)
Some Information Theoretic Saddlepoints (1985) (42)
Finite-state codes (1988) (37)
Bounds on the Average Binary Minimum Distance and the Maximum Likelihood Performance of Reed (2005) (36)
How to Compute Weight Enumerators for Convolutional Codes (2006) (36)
Performance analysis of turbo codes (1995) (34)
Scheduling algorithms for wireless ad-hoc sensor networks (2002) (34)
A note on the Griesmer bound (Corresp.) (1973) (33)
BSC Thresholds for Code Ensembles Based on “Typical Pairs” Decoding (2001) (32)
On the existence of optimum cyclic burst-correcting codes (1986) (32)
Node Synchronization for the Viterbi Decoder (1983) (32)
A Study of Viterbi's Ratio-Threshold AJ Technique (1984) (31)
Communication in the Presence of Jamming-An Information-Theoretic Approach (1983) (31)
Reed-Solomon Codes and the Exploration of the Solar System (1994) (29)
Correlation Properties of Sets of Sequences Derived from Irreducible Cyclic Codes (1980) (29)
Linear Recurring Sequences Over Finite Fields (1967) (29)
The Constantin-Rao Construction for Binary Assymmetric Error-Correcting Codes (1979) (28)
On the Average List Size for the Guruswami-sudan Decoder * (27)
On the Performance of Sphere Decoding of Block Codes (2009) (26)
On periodic sequences from GF(q) (1971) (26)
Truncation effects in Viterbi decoding (1989) (26)
Iterative min-sum decoding of tail-biting codes (1998) (25)
The reliability of computer memories (1985) (25)
Zeros of Functions in Finite Abelian Group Algebras (1976) (25)
Interpolation multiplicity assignment algorithms for algebraic soft-decision decoding of Reed-Solomon codes (2003) (25)
Ramsey bounds for graph products (1971) (24)
The Ultimate Limits of Binary Coding for a Wideband Gaussian Channel (1974) (24)
Coding protection for magnetic tapes: A generalization of the Patel - Hong code (1985) (23)
The partition weight enumerator of MDS codes and its applications (2005) (23)
On the capacity of channels with block memory (1988) (23)
There is no MacWilliams identity for convolutional codes (Corresp.) (1977) (22)
Factorization of polynomials over finite fields (1969) (20)
Phased burst error-correcting array codes (1993) (19)
Comments on 'A class of codes for axisymmetric channels and a problem from the additive theory of numbers' by Varshanov, R. R (1973) (18)
A low-rate improvement on the Elias bound (Corresp.) (1974) (17)
On the Average Complexity of Reed–Solomon List Decoders (2013) (17)
Maximal codeword lengths in Huffman codes (1992) (17)
Soft decision decoding of block codes (1978) (16)
An improved upper bound on the block coding error exponent for binary-input discrete memoryless channels (Corresp.) (1977) (16)
The number of stable points of an infinite-range spin glass memory (1985) (16)
The Viterbi decoding complexity of linear block codes (1994) (16)
Introduction to Discrete Mathematics (1989) (15)
Performance enhancements for algebraic soft decision decoding of Reed-Solomon codes (2004) (15)
An inequality on entropy (1995) (15)
A Note on the Wide-Band Gaussian Broadcast Channel (1986) (15)
Data Fusion Algorithms for Collaborative Robotic Exploration (2002) (15)
On the Design of Concatenated Coding Systems With Interleavers (1998) (15)
Weights of cyclic codes (1966) (14)
A Study of Optimal Abstract Jamming Strategies vs. Noncoherent MFSK (1983) (14)
A Turán Inequality Arising in Information Theory (1981) (14)
Coding for Optical Channels With Photon-Counting (1979) (14)
The practical limits of photon communication (1979) (13)
Performance of binary block codes at low signal-to-noise ratios (1992) (13)
The Theory of Information and Coding: Student Edition (2004) (13)
Algebraic list-decoding of Reed-Solomon product codes (2006) (12)
Performance of sphere decoding of block codes (2006) (12)
Symbol synchronization in convolutionally coded systems (Corresp.) (1979) (11)
Some VLSI decompositions of the de Bruijn graph (1992) (11)
The undetected error probability for Reed-Solomon codes (1988) (10)
Iterative Decoding for Sudoku and Latin Square Codes (2007) (10)
An improved upper bound on the block coding error exponent for binary input discrete memoryless channels (1976) (10)
Sphere-packing in the Hamming metric (1969) (10)
Some Partial Unit Memory Convolutional Codes (1991) (10)
Iterative Algebraic Soft Decision Decoding of Reed-Solomon Codes (2004) (9)
HIDING AND COVERING IN A COMPACT METRIC SPACE (1973) (9)
Trace-Shortened Reed-Solomon Codes (1994) (8)
CAPACITY AND CODING IN THE PRESENCE OF FADING AND JAMMING. (1981) (8)
Lifetime analyses of error-control coded semiconductor RAM systems (1982) (8)
Convergence analysis of SCCC and SCTCM with 'in-line' interleaver (2003) (8)
AVERAGE-CASE OPTIMIZED BUFFERED DECODERS. (1985) (8)
There is no MacWilliams identity for convolutional codes. [transmission gain comparison] (1977) (7)
Weights Modulo 8 in Binary Cyclic Codes (1972) (7)
Trellis Complexity Bounds for Decoding Linear Block Codes (1995) (7)
Capacity of the generalized PPM channel (2004) (7)
The Constantin-Rao construction for binary asymmetric error-correcting codes. [Deep Space Network] (1979) (6)
A dynamic graph algorithm for the highly dynamic network problem (2006) (6)
Data expansion with Huffman codes (1995) (6)
The general theory of convolutional codes (1993) (6)
Introduction to the special issue on codes and complexity (1996) (6)
The Optimal Code Rate vs. a Partial Band Jammer (1982) (6)
Further results on finite-state codes (1988) (6)
Achieving the Shannon Limit: A Progress Report (2000) (6)
General coding theorems for turbo-like codes (2000) (6)
On the symmetry of good nonlinear codes (1970) (6)
Decoding with multipliers (1976) (6)
Performance limits for FDMA cellular systems described by hypergraphs (1991) (6)
Random Sensory Networks: A Delay Analysis (2009) (6)
Entropy and mutual information (2002) (5)
Estimating the size of Huffman code preambles (1993) (5)
The decoding of Reed-Solomon codes (1988) (5)
The Bounds of Delsarte and Lovász, and Their Applications to Coding Theory (1979) (5)
Some Easily Analyzable Convolutional Codes (1989) (5)
Permutations preserving divisibility (2001) (4)
Covering Tori with Squares (1973) (4)
Delay issues in linear sensory networks (2004) (4)
The Ultimate Limits of Information Density (1988) (4)
Crosscorrelation Properties of m-Sequences (1987) (4)
Some Properties Of Memoryless Multiterminal Interference Channels (1991) (4)
Asymptotic weight enumerators of randomly punctured, expurgated, and shortened code ensembles (2008) (4)
A Comparison of Cdma and Frequency Hopping in a Cellular Environment (1992) (4)
Multiple-access channels without synchronization (1977) (4)
Coding for the photon channel (1979) (3)
Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network (2007) (3)
Constrained Entropy, Free Energy, and the Legendre Transform ∗ (2005) (3)
The Extended Invariant Factor Algorithm with Application to the Forney Analysis of Convolutional Codes (1993) (3)
A Markov chain model for the burst error statistics of Viterbi decoding (1990) (3)
An entropy maximization problem related to optical communication (1986) (3)
Life, the Universe and entropy (2006) (3)
Counting minimal generator matrices (1994) (3)
Intersymbol Interference in Pulse-Amplitude Modulation Signaling Systems Satisfying a Spectral Mask Constraint (2002) (3)
Constructions for finite-state codes (1987) (2)
Existence, Uniqueness, and Optimality of Sibling-Property Codes for Infinite Sources (2006) (2)
Coding for optical channels with photon-counting. [deep space network] (1979) (2)
A Golay-Viterbi Concatenated Coding Scheme for MJS'77 (1973) (2)
A simple decision procedure for Hofstadter’s Mitt-system (1988) (2)
An Error-Control Code with an Imbalance of Ones and Zeros to Provide a Residual Carrier Component (1986) (2)
Golay-Viterbi Decoding: Results of the MVM'73 X-Band Telemetry Experiment (1974) (2)
A Generalization of Difference Sets (1967) (2)
Timesharing without synchronization (1976) (2)
A Probabilistic Version of Sperner's TheoremWith Applications to the Problem of Retrieving Information From a Data Base (1978) (2)
Modeling artificial, mobile swarm systems (2003) (2)
Minimal Trellises for Linear Block Codes and Their Duals (1995) (2)
Information, coding and mathematics : proceedings of workshop honoring Prof. Bob McEliece on his 60th birthday (2002) (2)
Interleaved block codes for the photon channel (1980) (2)
ON SIMPLIFIED MODELLING OF THE LEAKY BUCKET (2001) (2)
Soft error correction for increased densities in VLSI memories (1984) (1)
BCH, Reed–Solomon, and related codes (2002) (1)
The Theory of Information and Coding: Entropy and mutual information (2004) (1)
The Theory of Information and Coding: Variable-length source coding (2002) (1)
Decoding the universe: How the new science of information is explaining everything in the cosmos, from our brains to black holes [Book Review] (2006) (1)
The Theory of m-Sequences (1987) (1)
Speaking of Communication (1986) (1)
The Theory of Information and Coding: Preface to the first edition (2004) (1)
The Theory of Information and Coding: References (2002) (1)
The Theory of Information and Coding: Cyclic codes (2002) (1)
Linear Recurrences over Finite Fields (1987) (1)
Junction tree representations for linear block codes (1998) (1)
Caltech Undergraduate Research Journal (CURJ) : [1996]- 1997 (1998) (1)
Results to get Maximal Quasihermitian Curves. New possibilities for AG Codes (2002) (1)
Heavy traffic performance of a class of channel assignment algorithms (cellular telephone systems) (1992) (1)
Coding for optical channels (1979) (1)
Some Mysterious Sequences Associated with LDPC Codes (2007) (1)
Frequency-E cient Coding with Low-Density Generator Matrices (1997) (1)
Performance of Some Block Codes on a Gaussian Channel (1975) (1)
A comparison of CDMA and frequency hopping in a cellular environment (1992) (1)
Error and erasure probabilities for Galileo uplink code (1985) (1)
On the inherent intractability of finding good codes (1977) (1)
The Theory of Information and Coding: A Framework for Communication (volume 3 of Encyclopedia of Mathematics and Its Applications.) (1980) (1)
Average distance structures of random convolutional codes (1988) (1)
Trace, Norm, and Bit-Serial Multiplication (1987) (1)
Factoring Polynomials over Finite Fields (1987) (1)
Buffer occupancy of statistical multiplexers with periodic interchangeable traffic in ATM networks (1997) (1)
An optimization method for designing high rate and high performance SCTCM systems with in-line interleavers (2004) (1)
Capacity of the Generalized Pulse-Position Modulation Channel (2005) (0)
An Easy-to-implement Coding Scheme for Multifrequency PPM (1984) (0)
The Theory of Information and Coding: Finite fields (2002) (0)
IlL Transfer Function for ZRL Codes (0)
An Electrifying Century - Electrical Engineering: An Early History of the Caltech EE Department (2010) (0)
Modifications of the Griesmer bound (1991) (0)
The Generalized Distributive Law * a Portion of Mceliece's Contribution Was Performed at the Sony Corporation in Tokyo, While He Was a Holder of a Sony Sabbatical Chair (0)
Figure 3. Junction Tree for Gdl Example Local Domain Local Kernel Fx 1 G (0)
Gus' last theorem? Fast multiplication in GF (2/sup m/) (1997) (0)
A probabilistic Sperner's theorem, with applications to the problem of retrieving information from a data base (1978) (0)
The Theory of Information and Coding: Linear codes (2002) (0)
Introduction to discrete mathematics / Robert J. McEliece, Robert B. Ash, Carol Ash (1989) (0)
The Theory of Information and Coding: Section editor's foreword (2002) (0)
The Theory of Information and Coding: Survey of advanced topics for part one (2002) (0)
Finding the best path in a binary Block Interference network (2008) (0)
Synchronization strategies for RFI channels (1977) (0)
Finite Fields Exist and are Unique (1987) (0)
Trellis-canonical generator matrices for convolutional codes (1997) (0)
Review of 'A Collection of Contributions in Honour of Jack Van Lint (Topics in Discrete Mathematics, vol. 7)' (Cameron, P.J., and van Tilborg, H.C.A., Eds.; 1992) (1994) (0)
The Theory of Information and Coding: Discrete memoryless channels and their capacity–cost functions (2004) (0)
AG Goppa Codes from Maximal Curves over determined Finite Fields of characteristic 2 (2006) (0)
Uncorrectable sequences and telecommand (1993) (0)
The Theory of Information and Coding: The Gaussian channel and source (2004) (0)
GERHARD KRAMER, Publications Editor ADRIAAN J. VAN WIJNGAARDEN, Publications Editor (2005) (0)
Gus' Last Theorem? Fast Multiplication i (2 (1997) (0)
The Theory of Information and Coding: Editor's statement (2002) (0)
The Combinatorics of Differentiation (2008) (0)
Cyclic codes and exponential sums (1969) (0)
The R sub 0 parameter for the Gaussian channel (1981) (0)
The Theory of Information and Coding: Introduction (2002) (0)
Introduction to Algebraic Soft-decision Decoding of Reed-solomon Codes (0)
Unique Factorization in Euclidean Domains (1987) (0)
Discrete memoryless sources and their rate-distortion functions (2002) (0)
Reliable Communication in the Presence of Severe Noise or Jamming (1993) (0)
OPTIMUM BINARY CYCLIC BURST CORRECTING CODES. (1986) (0)
Advances In Coding For Nearly Errorless Communication (1993) (0)
A note on the R sub 0-parameter for discrete memoryless channels (1980) (0)
Behavior of codes at very low signal-to-noise ratio (1988) (0)
The Theory of Information and Coding: Convex functions and Jensen's inequality (2002) (0)
An Analysis of Alternate Symbol Inversion for Improved Symbol Synchronization in Convolutionally Coded Systems (1978) (0)
Turbo Decoding of High Performance Error-Correcting Codes via Belief Propagation (1998) (0)
On the Multiuser Error Probability and the Maximum Likelihood Performance of MDS Codes (2006) (0)
On Generalized Parity Checks (2006) (0)
Spectrum Allocation Strategies for Communication Networks. (1994) (0)
The Theory of Information and Coding: Path enumeration in directed graphs (2004) (0)
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (1993) (0)
Trellis Coding on Fading Channels (2002) (0)
A Note on Digital Signatures (1979) (0)
RFI Channels (2010) (0)
The Theory of Information and Coding: Probability theory (2002) (0)
Discrete memoryless channels and their capacity–cost functions (2002) (0)
Euclidean Domains and Euclid’s Algorithm (1987) (0)
Channe ls with Block Interference (1998) (0)
Computing the number of rational points. Applications to AG Coding Theory (2008) (0)
RFI channels, 2 (1981) (0)
Data Expansion with Huffmian CQ (1994) (0)
The Guruswam-sudan Decoding Algorithm for Reed-solomon Codes (0)
Efficient Coding for Optical Communication (1984) (0)
Safety in Numbers: Protecting Data Mathemagically (1989) (0)
The Theory of Information and Coding: Convolutional codes (2002) (0)
PRS Coded Modulation (2002) (0)
The Gaussian channel and source (2002) (0)
An asymptotic analysis of a general class of signal detection algorithms (1977) (0)
Path enumeration in directed graphs (2002) (0)
Introduction to Coded Modulation (2002) (0)
The Theory of Information and Coding: The source–channel coding theorem (2002) (0)
The Trellis Complexity of Convolutio €?S1 (1993) (0)
The analysis of convolutional codes via the extended Smith algorithm (1993) (0)
Coding for Spread-Spectrum Channels in the Presence of Jamming (1986) (0)
ZEROS OF FUNCTIONS IN FINITE (2016) (0)
Abstract Properties of Finite Fields (1987) (0)
Recent advances in coding theory for near error-free communications (1991) (0)
Building Fields from Euclidean Domains (1987) (0)

This paper list is powered by the following services:

Other Resources About Robert McEliece

en.wikipedia.org

What Schools Are Affiliated With Robert McEliece?

Robert McEliece is affiliated with the following schools:

Robert McEliece's Academic­Influence.com Rankings

Why Is Robert McEliece Influential?

Robert McEliece's Published Works

Published Works

Other Resources About Robert McEliece

What Schools Are Affiliated With Robert McEliece?

Robert McEliece's AcademicInfluence.com Rankings