<h1>McEliece, Robert J.</h1> <h2>Book Chapter from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2> <ul> <li>Boyle, Elette C. and McEliece, Robert J. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100716-084106809">Asymptotic Weight Enumerators of Randomly Punctured, Expurgated, and Shortened Code Ensembles</a>; ISBN 978-1-4244-2925-7; 2008 46th annual Allerton Conference on Communication, Control, and Computing; 910-917; <a href="https://doi.org/10.1109/ALLERTON.2008.4797654">10.1109/ALLERTON.2008.4797654</a></li> <li>Bertiger, Anna S. and McEliece, Robert J., el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180809-133557549">The Combinatorics of Differentiation</a>; ISBN 9783540859116; Sequences and Their Applications - SETA 2008; 142-152; <a href="https://doi.org/10.1007/978-3-540-85912-3_13">10.1007/978-3-540-85912-3_13</a></li> <li>Soedarmadji, Edwin and McEliece, Robert J. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190304-090608519">Finding the best path in a binary Block Interference network</a>; ISBN 978-1-4244-2571-6; 2008 IEEE International Symposium on Information Theory; 335-338; <a href="https://doi.org/10.1109/ISIT.2008.4595003">10.1109/ISIT.2008.4595003</a></li> <li>McEliece, Robert J. and Sweatlock, Sarah L. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200204-105926568">Some Mysterious Sequences Associated with LDPC Codes</a>; ISBN 978-3-540-77403-7; Sequences, Subsequences, and Consequences; 153-161; <a href="https://doi.org/10.1007/978-3-540-77404-4_15">10.1007/978-3-540-77404-4_15</a></li> <li>Soedarmadji, Edwin and McEliece, Robert J. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20101015-111219862">Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network</a>; ISBN 978-1-4244-0352-3; 2007 IEEE International Conference on Communications; 153-157; <a href="https://doi.org/10.1109/ICC.2007.33">10.1109/ICC.2007.33</a></li> <li>Klimesh, Matthew and McEliece, Robert J. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170509-170830648">Existence, Uniqueness, and Optimality of Sibling-Property Codes for Infinite Sources</a>; ISBN 1-4244-0505-X; 2006 IEEE International Symposium on Information Theory; 2536-2540; <a href="https://doi.org/10.1109/ISIT.2006.262089">10.1109/ISIT.2006.262089</a></li> <li>El-Khamy, Mostafa and Vikalo, Haris, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170508-174050826">On the Performance of Sphere Decoding of Block Codes</a>; ISBN 1-4244-0505-X; 2006 IEEE International Symposium on Information Theory; 1964-1968; <a href="https://doi.org/10.1109/ISIT.2006.261824">10.1109/ISIT.2006.261824</a></li> <li>McEliece, Robert J. and Rodriguez-Palánquex, M. C. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170511-125313453">AG Goppa Codes from Maximal Curves over determined Finite Fields of characteristic 2</a>; ISBN 1-4244-0505-X; 2006 IEEE International Symposium on Information Theory; 1066-1069; <a href="https://doi.org/10.1109/ISIT.2006.261891">10.1109/ISIT.2006.261891</a></li> <li>McEliece, Robert J. and Soedarmadji, Edwin (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200204-111546794">On Generalized Parity Checks</a>; ISBN 978-3-540-31423-3; Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 29-34; <a href="https://doi.org/10.1007/11617983_2">10.1007/11617983_2</a></li> <li>Soedarmadji, Edwin and McEliece, Robert J. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110616-134644787">A dynamic graph algorithm for the highly dynamic network problem</a>; ISBN 0-7695-2520-2; Fourth annual IEEE International Conference on Pervasive Computing and Communications Workshops; 101-105; <a href="https://doi.org/10.1109/PERCOMW.2006.5">10.1109/PERCOMW.2006.5</a></li> <li>El-Khamy, Mostafa and McEliece, Robert J. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ELKisit05">The partition weight enumerator of MDS codes and its applications</a>; ISBN 0-7803-9151-9; 2005 IEEE International Symposium on Information Theory (ISIT) : Adelaide, Australia, 4-9 September, 2005; 926-930</li> <li>Fogal, S. L. and McEliece, Robert, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110810-094621665">Enumerators for protograph ensembles of LDPC codes</a>; ISBN 0-7803-9150-0; 2005 IEEE International Symposium on Information Theory; 2156-2160; <a href="https://doi.org/10.1109/ISIT.2005.1523728">10.1109/ISIT.2005.1523728</a></li> <li>Yokokawa, Takashi and Shinohara, Yuji, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:YOKglobecom04">An optimization method for designing high rate and high performance SCTCM systems with in-line interleavers</a>; ISBN 0780387945; IEEE Global Telecommunications Conference, GLOBECOM '04, 29 November-3 December 2004; 162-166</li> <li>El-Khamy, Mostafa and McEliece, Robert J., el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ELKisit04">Performance enhancements for algebraic soft decision decoding of Reed-Solomon codes</a>; ISBN 0-7803-8280-3; 2004 IEEE International Symposium on Information Theory : proceedings : Chicago Downtown Marriott, Chicago, Illinois, USA, June 27-July 2, 2004; 419; <a href="https://doi.org/10.1109/ISIT.2004.1365456">10.1109/ISIT.2004.1365456</a></li> <li>Florens, Cédric and Sharif, Masoud, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110818-092750820">Delay issues in linear sensory networks</a>; ISBN 0-7803-8280-3; 2004 IEEE International Symposium on Information Theory; 81; <a href="https://doi.org/10.1109/ISIT.2004.1365119">10.1109/ISIT.2004.1365119</a></li> <li>Hamkins, Jon and Klimesh, Matthew, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110818-095939379">Capacity of the Generalized PPM Channel</a>; ISBN 0-7803-8280-3; 2004 IEEE International Symposium on Information Theory; 334-334; <a href="https://doi.org/10.1109/ISIT.2004.1365371">10.1109/ISIT.2004.1365371</a></li> <li>Harel, Jonathan and McEliece, Robert J., el al. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190205-155742864">Poset belief propagation-experimental results</a>; ISBN 0780377281; IEEE International Symposium on Information Theory, 2003. Proceedings.; 177; <a href="https://doi.org/10.1109/isit.2003.1228191">10.1109/isit.2003.1228191</a></li> <li>Iida, Yasuhiro and Yokokawa, Takashi, el al. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111018-132205471">Convergence analysis of SCCC and SCTCM with 'in-line' interleaver</a>; ISBN 0-7803-7728-1; 2003 IEEE International Symposium on Information Theory; 410-410; <a href="https://doi.org/10.1109/ISIT.2003.1228427">10.1109/ISIT.2003.1228427</a></li> <li>Florens, Cédric and McEliece, Robert (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FLOinfocom03">Packets distribution algorithms for sensor networks</a>; ISBN 0-7803-7753-2; Joint Conference of the IEEE Computer and Communications Societies, 22nd, IEEE INFOCOM 2003, San Francisco, CA, 30 March-3 April 2003; 1063-1072</li> <li>McEliece, Robert J. and Yildirim, Muhammed (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200204-144202684">Belief Propagation on Partially Ordered Sets</a>; ISBN 978-1-4419-2326-4; Mathematical Systems Theory in Biology, Communications, Computation, and Finance; 275-299; <a href="https://doi.org/10.1007/978-0-387-21696-6_10">10.1007/978-0-387-21696-6_10</a></li> <li>Florens, Cédric and McEliece, Robert (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111102-092635109">Scheduling algorithms for wireless ad-hoc sensor networks</a>; ISBN 0-7803-7632-3; GLOBECOM'02: IEEE Global Telecommunications Conference; 6-10; <a href="https://doi.org/10.1109/GLOCOM.2002.1188031">10.1109/GLOCOM.2002.1188031</a></li> <li>McEliece, Robert J. and Rodriguez-Palánquex, M. C. (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200204-103116134">Results to get Maximal Quasihermitian Curves. New possibilities for AG Codes</a>; ISBN 978-1-4419-5289-9; Information, Coding and Mathematics: Proceedings of Workshop honoring Prof. Bob McEliece on his 60th birthday; 55-62; <a href="https://doi.org/10.1007/978-1-4757-3585-7_4">10.1007/978-1-4757-3585-7_4</a></li> <li>Khandekar, Aamod and McEliece, Robert J. (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111104-122318374">On the complexity of reliable communication on the erasure channel</a>; ISBN 0-7803-7123-2; 2001 IEEE International Symposium on Information Theory; 1; <a href="https://doi.org/10.1109/ISIT.2001.935864">10.1109/ISIT.2001.935864</a></li> <li>Aji, Srinivas and Jin, Hui, el al. (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200204-145114201">BSC Thresholds for Code Ensembles Based on "Typical Pairs" Decoding</a>; ISBN 978-0-387-95173-7; Codes, Systems, and Graphical Models; 195-210; <a href="https://doi.org/10.1007/978-1-4613-0165-3_11">10.1007/978-1-4613-0165-3_11</a></li> <li>Divsalar, D. and Dolinar, S., el al. (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111128-074933357">AWGN Coding Theorems from Ensemble Weight Enumerators</a>; ISBN 0-7803-5858-9; 2000 IEEE International Symposium on Information Theory; 459-459; <a href="https://doi.org/10.1109/ISIT.2000.866757">10.1109/ISIT.2000.866757</a></li> <li>Jin, Hui and McEliece, Robert J. (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111130-082915053">General coding theorems for turbo-like codes</a>; ISBN 0-7803-5857-0; 2000 IEEE International Symposium on Information Theory; 120-120; <a href="https://doi.org/10.1109/ISIT.2000.866412">10.1109/ISIT.2000.866412</a></li> <li>Jin, Hui and McEliece, Robert J. (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200204-152225846">RA Codes Achieve AWGN Channel Capacity</a>; ISBN 978-3-540-66723-0; Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 10-18; <a href="https://doi.org/10.1007/3-540-46796-3_2">10.1007/3-540-46796-3_2</a></li> <li>McEliece, Robert J. and Xu, Meina (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111222-140131828">Junction tree representations for linear block codes</a>; ISBN 0-7803-5000-6; 1998 IEEE International Symposium on Information Theory; 253-253; <a href="https://doi.org/10.1109/ISIT.1998.708858">10.1109/ISIT.1998.708858</a></li> <li>Lin, Wei and McEliece, Robert J., el al. (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120119-094316404">The Trellis Evolution Algorithm for Nonlinear Block Codes</a>; ISBN 0-7803-5000-6; 1998 IEEE International Symposium on Information Theory; 254-254; <a href="https://doi.org/10.1109/ISIT.1998.708859">10.1109/ISIT.1998.708859</a></li> <li>Aji, Srinivas and Horn, Gavin, el al. (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:AJIitw98">Iterative min-sum decoding of tail-biting codes</a>; ISBN 0-7803-4408-1; Information Theory Workshop, 1998 (ITW '98), Killarney, Ireland, 22-26 June 1998; 68-69; <a href="https://doi.org/10.1109/ITW.1998.706439">10.1109/ITW.1998.706439</a></li> <li>Aji, Srinivas M. and Horn, Gavin B., el al. (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:AJIisit98">Iterative decoding on graphs with a single cycle</a>; ISBN 0-7803-5000-6; Proceedings, 1998 IEEE International Symposium on Information Theory (ISIT '98), Cambridge, MA, August 16-21, 1998; 276; <a href="https://doi.org/10.1109/ISIT.1998.708881">10.1109/ISIT.1998.708881</a></li> <li>McEliece, Robert J. (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120126-091409643">Gus' last theorem? Fast multiplication in GF (2^m)</a>; ISBN 0-7803-3906-1; 1997 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing: PACRIM, 10 years, 1987-1997; 736-738; <a href="https://doi.org/10.1109/PACRIM.1997.620364">10.1109/PACRIM.1997.620364</a></li> <li>Lin, Wei and McEliece, Robert J., el al. (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120120-100255991">Trellis-Canonical Generator Matrices for Convolutional Codes</a>; ISBN 0-7803-3956-8; 1997 IEEE International Symposium on Information Theory, Proceedings; 286-286; <a href="https://doi.org/10.1109/ISIT.1997.613207">10.1109/ISIT.1997.613207</a></li> <li>Horn, Gavin B. and McEliece, Robert J. (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120120-073411865">Belief Propagation in Loopy Bayesian Networks: Experimental Results</a>; ISBN 0-7803-3956-8; 1997 IEEE International Symposium on Information Theory, Proceedings; 232-232; <a href="https://doi.org/10.1109/ISIT.1997.613147">10.1109/ISIT.1997.613147</a></li> <li>Aji, Srinivas M. and McEliece, Robert J. (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:AJIisit97">A general algorithm for distributing information in a graph</a>; ISBN 0-7803-3956-8; Proceedings, 1997 IEEE International Symposium on Information Theory (ISIT '97), Ulm, Germany, June 29-July 4, 1997; 6; <a href="https://doi.org/10.1109/ISIT.1997.612921">10.1109/ISIT.1997.612921</a></li> <li>Yu, Zhong and McEliece, Robert J. (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:YUZisit97">Buffer occupancy of statistical multiplexers with periodic interchangeable traffic in ATM networks</a>; ISBN 0780339568; IEEE International Symposium on Information Theory (ISIT 1997), Ulm, Germany, 29 June-4 July 1997; 31; <a href="https://doi.org/10.1109/ISIT.1997.612946">10.1109/ISIT.1997.612946</a></li> <li>Divsalar, D. and Dolinar, S., el al. (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120216-101442622">Performance Analysis of Turbo Codes</a>; ISBN 0-7803-2489-7; MILCOM '95: 14th Military communications conference; 91-96; <a href="https://doi.org/10.1109/MILCOM.1995.483278">10.1109/MILCOM.1995.483278</a></li> <li>McEliece, Robert J. and Lin, Wei (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120223-102920927">The trellis complexity of convolutional codes</a>; ISBN 0-7803-2453-6; Proceedings 1995 IEEE International Symposium on Information Theory; 131-131; <a href="https://doi.org/10.1109/ISIT.1995.531335">10.1109/ISIT.1995.531335</a></li> <li>McEliece, Robert J. and Yu, Zhong (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120223-100956421">An Inequality On Entropy</a>; ISBN 0-7803-2453-6; Proceedings 1995 IEEE International Symposium on Information Theory; 329-329; <a href="https://doi.org/10.1109/ISIT.1995.550316">10.1109/ISIT.1995.550316</a></li> <li>Cheng, Jung-Fu and McEliece, Robert J. (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:CHEisit95b">Unit-memory Hamming turbo codes</a>; ISBN 0-7803-2453-6; IEEE International Symposium on Information Theory (ISIT '95), Whistler, British Columbia, 17-22 September 1995; 33; <a href="https://doi.org/10.1109/ISIT.1995.531135">10.1109/ISIT.1995.531135</a></li> <li>Cheng, Jung-Fu and Dolinar, Sam, el al. (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:CHEisit95a">Data expansion with Huffman codes</a>; ISBN 0-7803-2453-6; IEEE International Symposium on Information Theory (ISIT '95), Whistler, British Columbia, 17-22 September 1995; 325; <a href="https://doi.org/10.1109/ISIT.1995.531102">10.1109/ISIT.1995.531102</a></li> <li>Hattori, Masayuki and McEliece, Robert J., el al. (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:HATisit94">Subspace subcodes of Reed-Solomon codes</a>; ISBN 0780320158; Proceedings 1994 IEEE International Symposium on Information Theory : The Norwegian Institute of Technology, Trondheim, Norway, June 27 - July 1, 1994; 430; <a href="https://doi.org/10.1109/ISIT.1994.395045">10.1109/ISIT.1994.395045</a></li> <li>McEliece, Robert J. (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120221-092955129">The Viterbi decoding complexity of linear block codes</a>; ISBN 0-7803-2015-8; Proceedings 1994 IEEE International Symposium on Information Theory; 341-341; <a href="https://doi.org/10.1109/ISIT.1994.394677">10.1109/ISIT.1994.394677</a></li> <li>Lumbard, Kim E. and McEliece, Robert J. (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120222-134457817">Counting minimal generator matrices</a>; ISBN 0-7803-2015-8; Proceedings 1994 IEEE International Symposium on Information Theory; 18-18; <a href="https://doi.org/10.1109/ISIT.1994.394953">10.1109/ISIT.1994.394953</a></li> <li>Mandell, Michael I. and McEliece, Robert J. (1993) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170601-145953562">A Comparison of CDMA and Frequency Hopping in a Cellular Environment</a>; ISBN 0-7803-0878-6; Proceedings. IEEE International Symposium on Information Theory; 252-252; <a href="https://doi.org/10.1109/ISIT.1993.748566">10.1109/ISIT.1993.748566</a></li> <li>McEliece, Robert J. and Onyszchuk, Ivan (1993) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120309-122814096">The Extended Invariant Factor Algorithm with Application to the Forney Analysis of Convolutional Codes</a>; ISBN 0-7803-0878-6; 1993 Proceedings of the International Symposium on Information Theory; 142-142; <a href="https://doi.org/10.1109/ISIT.1993.748457">10.1109/ISIT.1993.748457</a></li> <li>McEliece, Robert J. and Sivarajan, Kumar N. (1992) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120329-101208582">Heavy traffic performance of a class of channel assignment algorithms</a>; ISBN 0-7803-0841-7; Third IEEE International Symposium on Personal, Indoor and Mobile Radio Communications; 550-555; <a href="https://doi.org/10.1109/PIMRC.1992.279871">10.1109/PIMRC.1992.279871</a></li> <li>Mandell, Michael I. and McEliece, Robert J. (1992) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120307-114648821">A Comparison of CDMA and Frequency Hopping in a Cellular Environment</a>; ISBN 0-7803-0591-4; 1st International Conference on Universal Personal Communications, Proceedings (ICUPC '92); 252-252; <a href="https://doi.org/10.1109/ICUPC.1992.240779">10.1109/ICUPC.1992.240779</a></li> <li>Dolinar, Sam and Ko, Tsz-Mei, el al. (1992) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120328-130309049">VLSI decompositions for deBruijn graphs</a>; ISBN 0-7803-0593-0; Proceedings 1992 IEEE International Symposium on Circuits and Systems; 1855-1858; <a href="https://doi.org/10.1109/ISCAS.1992.230451">10.1109/ISCAS.1992.230451</a></li> <li>McEliece, Robert J. and Sivaraian, Kumar N. (1991) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170620-165537084">Asymptotic Performance Of Fixed And Dynamic Channel Assignment In Cellular Radio</a>; ISBN 0-7803-0056-4; Proceedings. 1991 IEEE International Symposium on Information Theory; 154; <a href="https://doi.org/10.1109/ISIT.1991.695210">10.1109/ISIT.1991.695210</a></li> <li>Sayano, Masahiro and Goodman, Rodney M., el al. (1991) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170620-150041378">Single Phased Burst Error Correcting Array Codes</a>; ISBN 0-7803-0056-4; Proceedings. 1991 IEEE International Symposium on Information Theory; 195; <a href="https://doi.org/10.1109/ISIT.1991.695251">10.1109/ISIT.1991.695251</a></li> <li>Mandell, Michael and McEliece, R. (1991) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170620-143807037">Some Properties Of Memoryless Multiterminal Interference Channels</a>; ISBN 0-7803-0056-4; Proceedings. 1991 IEEE International Symposium on Information Theory; 212; <a href="https://doi.org/10.1109/ISIT.1991.695268">10.1109/ISIT.1991.695268</a></li> <li>Abdel-Ghaffar, Khaled and McEliece, Robert, el al. (1991) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190315-142359380">Some Partial Unit Memory Convolutional Codes</a>; ISBN 0780300564; Proceedings. 1991 IEEE International Symposium on Information Theory; 196; <a href="https://doi.org/10.1109/isit.1991.695252">10.1109/isit.1991.695252</a></li> <li>McEliece, Robert J. and Sivarajan, Kumar N. (1991) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170622-133511273">Performance Limits For Cellular Multiuser Communication Systems</a>; ISBN 0-7803-0056-4; Proceedings. 1991 IEEE International Symposium on Information Theory; 205; <a href="https://doi.org/10.1109/ISIT.1991.695261">10.1109/ISIT.1991.695261</a></li> <li>McEliece, R. J. and Sivarajan, K. N. (1991) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120423-111348165">Performance limits for FDMA cellular systems described by hypergraphs</a>; ISBN 0-85296-502-8; 1991 Third IEE Conference on Telecommunications; 360-365</li> <li>Sivarajan, Kumar N. and McEliece, Robert J., el al. (1990) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120509-135031162">Dynamic channel assignment in cellular radio</a>; <a href="https://doi.org/10.1109/VETEC.1990.110396">10.1109/VETEC.1990.110396</a></li> <li>McEliece, Robert J. and Onyszchuk, Ivan M. (1989) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120524-153350625">Truncation effects in Viterbi decoding</a>; <a href="https://doi.org/10.1109/MILCOM.1989.103985">10.1109/MILCOM.1989.103985</a></li> <li>Sivarajan, Kumar N. and McEliece, Robert J., el al. (1989) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120517-092808034">Channel assignment in cellular radio</a>; <a href="https://doi.org/10.1109/VETEC.1989.40173">10.1109/VETEC.1989.40173</a></li> <li>Cheung, Kar-Ming and McEliece, Robert J. (1988) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120216-080309345">The undetected error probability for Reed-Solomon codes</a>; <a href="https://doi.org/10.1109/MILCOM.1988.13385">10.1109/MILCOM.1988.13385</a></li> <li>Abdel-Ghaffar, Khaled and McEliece, Robert J. (1988) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200204-154400378">The Ultimate Limits of Information Density</a>; ISBN 978-94-010-7757-6; Performance Limits in Communication Theory and Practice; 267-279; <a href="https://doi.org/10.1007/978-94-009-2794-0_16">10.1007/978-94-009-2794-0_16</a></li> <li>Berlekamp, E. R. and Currie, R. J., el al. (1986) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170718-172840654">An Error-Control Code with an Imbalance of Ones and Zeros to Provide a Residual Carrier Component</a>; <a href="https://doi.org/10.1109/MILCOM.1986.4805784">10.1109/MILCOM.1986.4805784</a></li> <li>Berlekamp, Elwyn R. and McEliece, Robert J. (1985) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200205-082507132">Average-Case Optimized Buffered Decoders</a>; ISBN 978-94-010-8760-5; The Impact of Processing Techniques on Communications; 145-158; <a href="https://doi.org/10.1007/978-94-009-5113-6_9">10.1007/978-94-009-5113-6_9</a></li> <li>Abdel-Ghaffar, Khaled and McEliece, Robert J. (1984) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161026-163740202">Soft error correction for increased densities in VLSI memories</a>; ISBN 0-8186-0538-3; ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture; 248-250; <a href="https://doi.org/10.1145/800015.808191">10.1145/800015.808191</a></li> <li>McEliece, Robert J. and Rodemich, Eugene R. (1983) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190315-151103854">A Study of Optimal Abstract Jamming Strategies vs. Noncoherent MFSK</a>; <a href="https://doi.org/10.1109/MILCOM.1983.4794651">10.1109/MILCOM.1983.4794651</a></li> <li>McEliece, Robert J. (1983) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200204-155745654">Communication in the Presence of Jamming-An Information-Theoretic Approach</a>; ISBN 978-3-211-81784-1; Secure Digital Communications; 127-166; <a href="https://doi.org/10.1007/978-3-7091-2640-0_8">10.1007/978-3-7091-2640-0_8</a></li> <li>McEliece, R. J. and Stark, W. E. (1982) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190315-080818085">The Optimal Code Rate vs. a Partial Band Jammer</a>; <a href="https://doi.org/10.1109/MILCOM.1982.4805908">10.1109/MILCOM.1982.4805908</a></li> <li>McEliece, Robert J. (1979) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200205-110200018">Bounds of Delsarte and Lovász, and Their Applications to Coding Theory</a>; ISBN 978-3-662-38752-8; Algebraic Coding Theory and Applications; 107-178; <a href="https://doi.org/10.1007/978-3-662-39641-4_2">10.1007/978-3-662-39641-4_2</a></li> <li>McEliece, R. J. (1975) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200204-104545745">Irreducible Cyclic Codes and Gauss Sums</a>; ISBN 978-94-010-1828-9; Combinatorics; 185-202; <a href="https://doi.org/10.1007/978-94-010-1826-5_9">10.1007/978-94-010-1826-5_9</a></li> </ul>