McEliece, Robert J.

Article from CaltechAUTHORS

• Cassuto, Yuval and Bruck, Jehoshua, et el. (2013) On the Average Complexity of Reed–Solomon List Decoders; IEEE Transactions on Information Theory; Vol. 59; No. 4; 2336-2351; 10.1109/TIT.2012.2235522
• El-Khamy, Mostafa and Vikalo, Haris, et el. (2009) Performance of sphere decoding of block codes; IEEE Transactions on Communications; Vol. 57; No. 10; 2940-2950; 10.1109/TCOMM.2009.10.080402
• Florens, Cedric and Sharif, Masoud, et el. (2009) Random sensory networks: a delay in analysis; IEEE Transactions on Information Theory; Vol. 55; No. 4; 1650-1664; 10.1109/TIT.2009.2012999
• McEliece, Robert J. (2006) Decoding the universe: How the new science of information is explaining everything in the cosmos, from our brains to black holes [Book Review]; Nature; Vol. 441; No. 7092; 409-410; 10.1038/441409b
• El-Khamy, Mostafa and McEliece, Robert J. (2006) Iterative algebraic soft-decision list decoding of Reed-Solomon codes; IEEE Journal on Selected Areas in Communications; Vol. 24; No. 3; 481-490; 10.1109/JSAC.2005.862399
• Florens, Cédric and Franceschetti, Massimo, et el. (2004) Lower bounds on data collection time in sensory networks; IEEE Journal on Selected Areas in Communications; Vol. 22; No. 6; 1110-1120; 10.1109/JSAC.2004.830927
• Jin, Hui and McEliece, Robert J. (2002) Coding theorems for turbo code ensembles; IEEE Transactions on Information Theory; Vol. 48; No. 6; 1451-1461; 10.1109/TIT.2002.1003833
• McEliece, Robert J. and Le Dantec, Claude, et el. (2001) Permutations preserving divisibility; IEEE Transactions on Information Theory; Vol. 47; No. 3; 1206-1207; 10.1109/18.915685
• Abu-Mostafa, Y. S. and McEliece, R. J. (2000) Maximal codeword lengths in Huffman codes; Computers and Mathematics with Applications; Vol. 39; No. 11; 129-134; 10.1016/S0898-1221(00)00119-X
• Aji, Srinivas M. and McEliece, Robert J. (2000) The generalized distributive law; IEEE Transactions on Information Theory; Vol. 46; No. 2; 325-343; 10.1109/18.825794
• Hattori, Masayuki and McEliece, Robert J., et el. (1998) Subspace subcodes of Reed-Solomon codes; IEEE Transactions on Information Theory; Vol. 44; No. 5; 1861-1880; 10.1109/18.705564
• McEliece, Robert J. and MacKay, David J. C., et el. (1998) Turbo decoding as an instance of Pearl's "belief propagation" algorithm; IEEE Journal on Selected Areas in Communications; Vol. 16; No. 2; 140-152; 10.1109/49.661103
• Kiely, Aaron B. and Dolinar, Samuel J, Jr., et el. (1996) Trellis decoding complexity of linear block codes; IEEE Transactions on Information Theory; Vol. 42; No. 6, pt.; 1687-1697; 10.1109/18.556665
• McEliece, Robert J. and Lin, Wei (1996) The trellis complexity of convolutional codes; IEEE Transactions on Information Theory; Vol. 42; No. 6, par; 1855-1864; 10.1109/18.556680
• McEliece, Robert J. (1996) On the BCJR trellis for linear block codes; IEEE Transactions on Information Theory; Vol. 42; No. 4; 1072-1092; 10.1109/18.508834
• Divsalar, D. and McEliece, R. J. (1996) Effective free distance of turbo codes; Electronics Letters; Vol. 32; No. 5; 445-446; 10.1049/el:19960321
• McEliece, Robert J. and Sivarajan, Kumar N. (1994) Performance limits for channelized cellular telephone systems; IEEE Transactions on Information Theory; Vol. 40; No. 1; 21-34; 10.1109/18.272452
• Goodman, Rodney M. and McEliece, Robert J., et el. (1993) Phased burst error-correcting array codes; IEEE Transactions on Information Theory; Vol. 39; No. 2; 684-693; 10.1109/18.212304
• Chao, Chi-Chao and McEliece, Robert J., et el. (1992) Performance of binary block codes at low signal-to-noise ratios; IEEE Transactions on Information Theory; Vol. 38; No. 6; 1677-1687; 10.1109/18.165442
• Blumer, Anselm C. and McEliece, Robert J. (1988) The Rényi Redundancy of Generalized Huffman Codes; IEEE Transactions on Information Theory; Vol. 34; No. 5; 1242-1249; 10.1109/18.21251
• Pollara, Fabrizio and McEliece, Robert J., et el. (1988) Finite-state codes; IEEE Transactions on Information Theory; Vol. 34; No. 5; 1083-1089; 10.1109/18.21238
• Abdel-Ghaffar, Khaled A. S. and McEliece, Robert J., et el. (1988) Two-dimensional burst identification codes and their use in burst correction; IEEE Transactions on Information Theory; Vol. 34; No. 3; 494-504; 10.1109/18.6029
• Swanson, Laif and McEliece, Robert J. (1988) A simple decision procedure for Hofstadter's Mitt-system; The Mathematical Intelligencer; Vol. 10; No. 2; 48-49; 10.1007/bf03028356
• Stark, Wayne E. and McEliece, Robert J. (1988) On the capacity of channels with block memory; IEEE Transactions on Information Theory; Vol. 34; No. 2; 322-324; 10.1109/18.2642
• Blaum, Mario and Goodman, Rodney, et el. (1988) The reliability of single-error protected computer memories; IEEE Transactions on Computers; Vol. 37; No. 1; 114-119; 10.1109/12.75143
• McEliece, Robert J. and Posner, Edward C., et el. (1987) The capacity of the Hopfield associative memory; IEEE Transactions on Information Theory; Vol. 33; No. 4; 461-482; 10.1109/TIT.1987.1057328
• McEliece, Robert J. and Swanson, Laif (1987) A Note on the Wide-Band Gaussian Broadcast Channel; IEEE Transactions on Communications; Vol. 35; No. 4; 452-453; 10.1109/TCOM.1987.1096784
• Abdel-Ghaffar, Khaled A. S. and McEliece, Robert J., et el. (1986) On the existence of optimum cyclic burst-correcting codes; IEEE Transactions on Information Theory; Vol. IT-32; No. 6; 768-775; 10.1109/TIT.1986.1057242
• McEliece, Robert J. and Swanson, Laif (1986) On the decoder error probability for Reed-Solomon codes; IEEE Transactions on Information Theory; Vol. 32; No. 5; 701-703; 10.1109/TIT.1986.1057212
• McEliece, Robert J. and Rodemich, Eugene R., et el. (1986) An entropy maximization problem related to optical communication; IEEE Transactions on Information Theory; Vol. 32; No. 2; 322-326; 10.1109/TIT.1986.1057149
• Blaum, Mario and McEliece, Robert J. (1985) Coding protection for magnetic tapes: A generalization of the Patel-Hong code; IEEE Transactions on Information Theory; Vol. 31; No. 5; 690-693; 10.1109/TIT.1985.1057098
• Abdel-Ghaffar, Khaled and McEliece, Robert J. (1984) Soft error correction for increased densities in VLSI memories; ACM SIGARCH Computer Architecture News; Vol. 12; No. 3; 248-250; 10.1145/773453.808191
• Lorden, Gary and McEliece, Robert J., et el. (1984) Node Synchronization for the Viterbi Decoder; IEEE Transactions on Communications; Vol. 32; No. 5; 524-531; 10.1109/TCOM.1984.1096098
• McEliece, Robert J. and Stark, Wayne E. (1984) Channels with block interference; IEEE Transactions on Information Theory; Vol. 30; No. 1; 44-53; 10.1109/TIT.1984.1056848
• Goodman, R. M. F. and McEliece, R. J. (1982) Lifetime analyses of error-control coded semiconductor RAM systems; IEE Proceedings E Computers and Digital Techniques; Vol. 129; No. 3; 81-85; 10.1049/ip-e.1982.0017
• Cover, Thomas M. and McEliece, Robert J., et el. (1981) Asynchronous multiple-access channel capacity; IEEE Transactions on Information Theory; Vol. 27; No. 4; 409-413
• McEliece, Robert J. (1981) Practical codes for photon communication; IEEE Transactions on Information Theory; Vol. 27; No. 4; 393-398; 10.1109/TIT.1981.1056380
• Davisson, Lee D. and McEliece, Robert J., et el. (1981) Efficient Universal Noiseless Source Codes; IEEE Transactions on Information Theory; Vol. 27; No. 3; 269-279; 10.1109/TIT.1981.1056355
• Baumert, Leonard D. and McEliece, Robert J., et el. (1979) Symbol synchronization in convolutionally coded systems; IEEE Transactions on Information Theory; Vol. 25; No. 3; 362-365; 10.1109/TIT.1979.1056044
• Berlekamp, Elwyn R. and McEliece, Robert J., et el. (1978) On the inherent intractability of certain coding problems; IEEE Transactions on Information Theory; Vol. 24; No. 3; 384-386; 10.1109/TIT.1978.1055873
• Shearer, James B. and McEliece, Robert J. (1977) There is no MacWilliams identity for convolutional codes; IEEE Transactions on Information Theory; Vol. 23; No. 6; 775-776; 10.1109/TIT.1977.1055785
• McEliece, Robert J. and Omura, Jim K. (1977) An improved upper bound on the block coding error exponent for binary-input discrete memoryless channels; IEEE Transactions on Information Theory; Vol. 23; No. 5; 611-613; 10.1109/TIT.1977.1055772
• McEliece, Robert J. and Rodemich, Eugene R., et el. (1977) New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities; IEEE Transactions on Information Theory; Vol. 23; No. 2; 157-166; 10.1109/TIT.1977.1055688
• Welch, Lloyd R. and McEliece, Robert J., et el. (1974) A low-rate improvement on the Elias bound; IEEE Transactions on Information Theory; Vol. 20; No. 5; 676-678; 10.1109/TIT.1974.1055279
• Baumert, L. D. and McEliece, R. J. (1973) A note on the Griesmer bound; IEEE Transactions on Information Theory; Vol. 19; No. 1; 134-135; 10.1109/TIT.1973.1054939
• McEliece, Robert J. (1973) Comments on 'A class of codes for axisymmetric channels and a problem from the additive theory of numbers' by Varshanov, R. R.; IEEE Transactions on Information Theory; Vol. 19; No. 1; 137; 10.1109/TIT.1973.1054941
• McEliece, Robert J. (1970) On the symmetry of good nonlinear codes; IEEE Transactions on Information Theory; Vol. 16; No. 5; 609-611; 10.1109/TIT.1970.1054508