Robert J. McEliece

Affiliations:
  • California Institute of Technology, USA


According to our database1, Robert J. McEliece authored at least 75 papers between 1970 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2013
On the Average Complexity of Reed-Solomon List Decoders.
IEEE Trans. Inf. Theory, 2013

2009
Random Sensory Networks: A Delay Analysis.
IEEE Trans. Inf. Theory, 2009

Performance of sphere decoding of block codes.
IEEE Trans. Commun., 2009

2008
The Combinatorics of Differentiation.
Proceedings of the Sequences and Their Applications, 2008

Finding the best path in a binary Block Interference network.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Computing the number of rational points. Applications to AG Coding Theory.
Proceedings of the 2008 International Conference on Foundations of Computer Science, 2008

Asymptotic weight enumerators of randomly punctured, expurgated, and shortened code ensembles.
Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2007
Some Mysterious Sequences Associated with LDPC Codes.
Proceedings of the Sequences, Subsequences, and Consequences, International Workshop, 2007

Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network.
Proceedings of IEEE International Conference on Communications, 2007

2006
Iterative algebraic soft-decision list decoding of Reed-Solomon codes.
IEEE J. Sel. Areas Commun., 2006

A Dynamic Graph Algorithm for the Highly Dynamic Network Problem.
Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006

AG Goppa Codes from Maximal Curves over determined Finite Fields of characteristic 2.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Existence, Uniqueness, and Optimality of Sibling-Property Codes for Infinite Sources.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

On Generalized Parity Checks.
Proceedings of the Applied Algebra, 2006

2005
Enumerators for protograph ensembles of LDPC codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

The partition weight enumerator of MDS codes and its applications.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Lower bounds on data collection time in sensory networks.
IEEE J. Sel. Areas Commun., 2004

Capacity of the generalized PPM channel.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Delay issues in linear sensory networks.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Performance enhancements for algebraic soft decision decoding of Reed-Solomon codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

An optimization method for designing high rate and high performance SCTCM systems with in-line interleavers.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

2003
Packet distribution Algorithms for Sensor Networks.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

Interpolation multiplicity assignment algorithms for algebraic soft-decision decoding of Reed-Solomon codes.
Proceedings of the Algebraic Coding Theory and Information Theory, 2003

Belief Propagation on Partially Ordered Sets.
Proceedings of the Mathematical Systems Theory in Biology, 2003

2002
Coding theorems for turbo code ensembles.
IEEE Trans. Inf. Theory, 2002

Scheduling algorithms for wireless ad-hoc sensor networks.
Proceedings of the Global Telecommunications Conference, 2002

2001
Permutations preserving divisibility.
IEEE Trans. Inf. Theory, 2001

Introduction to the special issue on codes on graphs and iterative algorithms.
IEEE Trans. Inf. Theory, 2001

2000
The generalized distributive law.
IEEE Trans. Inf. Theory, 2000

1999
RA Codes Achieve AWGN Channel Capacity.
Proceedings of the Applied Algebra, 1999

1998
Subspace Subcodes of Reed-Solomon Codes.
IEEE Trans. Inf. Theory, 1998

Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm.
IEEE J. Sel. Areas Commun., 1998

1996
The trellis complexity of convolutional codes.
IEEE Trans. Inf. Theory, 1996

On the BCJR trellis for linear block codes.
IEEE Trans. Inf. Theory, 1996

Trellis decoding complexity of linear block codes.
IEEE Trans. Inf. Theory, 1996

Introduction to the special issue on codes and complexity.
IEEE Trans. Inf. Theory, 1996

1994
Performance limits for channelized cellular telephone systems.
IEEE Trans. Inf. Theory, 1994

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).
IEEE Trans. Inf. Theory, 1994

1993
Phased burst error-correcting array codes.
IEEE Trans. Inf. Theory, 1993

1992
Performance of binary block codes at low signal-to-noise ratios.
IEEE Trans. Inf. Theory, 1992

A VLSI Decomposition of the deBruijn Graph.
J. ACM, 1992

Some VLSI decompositions of the de Bruijn graph.
Discret. Math., 1992

Heavy traffic performance of a class of channel assignment algorithms (cellular telephone systems).
Proceedings of the Third IEEE International Symposium on Personal, 1992

1988
On the capacity of channels with block memory.
IEEE Trans. Inf. Theory, 1988

Finite-state codes.
IEEE Trans. Inf. Theory, 1988

The Rényi redundancy of generalized Huffman codes.
IEEE Trans. Inf. Theory, 1988

Two-dimensional burst identification codes and their use in burst correction.
IEEE Trans. Inf. Theory, 1988

The Reliability of Single-Error Protected Computer Memories.
IEEE Trans. Computers, 1988

1987
The capacity of the Hopfield associative memory.
IEEE Trans. Inf. Theory, 1987

A Note on the Wide-Band Gaussian Broadcast Channel.
IEEE Trans. Commun., 1987

1986
On the decoder error probability for Reed-Solomon codes.
IEEE Trans. Inf. Theory, 1986

An entropy maximization problem related to optical communication.
IEEE Trans. Inf. Theory, 1986

On the existence of optimum cyclic burst-correcting codes.
IEEE Trans. Inf. Theory, 1986

1985
Coding protection for magnetic tapes: A generalization of the Patel - Hong code.
IEEE Trans. Inf. Theory, 1985

1984
Channels with block interference.
IEEE Trans. Inf. Theory, 1984

Node Synchronization for the Viterbi Decoder.
IEEE Trans. Commun., 1984

Soft Error Correction for Increased Densities in VLSI Memories.
Proceedings of the 11th Annual Symposium on Computer Architecture, 1984

1981
Practical codes for photon communication.
IEEE Trans. Inf. Theory, 1981

Efficient universal noiseless source codes.
IEEE Trans. Inf. Theory, 1981

Asynchronous multiple-access channel capacity.
IEEE Trans. Inf. Theory, 1981

On Sharing Secrets and Reed-Solomon Codes.
Commun. ACM, 1981

1980
Correlation Properties of Sets of Sequences Derived from Irreducible Cyclic Codes
Inf. Control., April, 1980

The Constantin-Rao Construction for Binary Assymmetric Error-Correcting Codes
Inf. Control., February, 1980

1979
Symbol synchronization in convolutionally coded systems (Corresp.).
IEEE Trans. Inf. Theory, 1979

1978
On the inherent intractability of certain coding problems (Corresp.).
IEEE Trans. Inf. Theory, 1978

1977
There is no MacWilliams identity for convolutional codes (Corresp.).
IEEE Trans. Inf. Theory, 1977

New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities.
IEEE Trans. Inf. Theory, 1977

An improved upper bound on the block coding error exponent for binary-input discrete memoryless channels (Corresp.).
IEEE Trans. Inf. Theory, 1977

1974
A low-rate improvement on the Elias bound (Corresp.).
IEEE Trans. Inf. Theory, 1974

1973
Comments on 'A class of codes for axisymmetric channels and a problem from the additive theory of numbers' by Varshanov, R. R.
IEEE Trans. Inf. Theory, 1973

A note on the Griesmer bound (Corresp.).
IEEE Trans. Inf. Theory, 1973

Covering Tori with Squares.
J. Comb. Theory A, 1973

1972
Weights of Irreducible Cyclic Codes
Inf. Control., March, 1972

Weight congruences for p-ary cyclic codes.
Discret. Math., 1972

1970
On the symmetry of good nonlinear codes.
IEEE Trans. Inf. Theory, 1970


  Loading...