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