@article{https://resolver.caltech.edu/CaltechAUTHORS:20130429-085506668,
    title = "On the Average Complexity of Reed–Solomon List Decoders",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130429-085506668",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2012.2235522",
    volume = "59"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20091106-102918514,
    title = "Performance of sphere decoding of block codes",
    journal = "IEEE Transactions on Communications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20091106-102918514",
    id = "record",
    issn = "0090-6778",
    doi = "10.1109/TCOMM.2009.10.080402",
    volume = "57"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20090608-121100170,
    title = "Random sensory networks: a delay in analysis",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20090608-121100170",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2009.2012999",
    volume = "55"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100716-084106809,
    title = "2008 46th annual Allerton Conference on Communication, Control, and Computing",
    chapter = "Asymptotic Weight Enumerators of Randomly Punctured, Expurgated, and Shortened Code Ensembles",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20100716-084106809",
    id = "record",
    isbn = "978-1-4244-2925-7",
    doi = "10.1109/ALLERTON.2008.4797654"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20180809-133557549,
    title = "Sequences and Their Applications - SETA 2008",
    chapter = "The Combinatorics of Differentiation",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180809-133557549",
    id = "record",
    isbn = "9783540859116",
    doi = "10.1007/978-3-540-85912-3\_13"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190304-090608519,
    title = "2008 IEEE International Symposium on Information Theory",
    chapter = "Finding the best path in a binary Block Interference network",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190304-090608519",
    id = "record",
    isbn = "978-1-4244-2571-6",
    doi = "10.1109/ISIT.2008.4595003"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200204-105926568,
    title = "Sequences, Subsequences, and Consequences",
    chapter = "Some Mysterious Sequences Associated with LDPC Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200204-105926568",
    id = "record",
    isbn = "978-3-540-77403-7",
    doi = "10.1007/978-3-540-77404-4\_15"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20101015-111219862,
    title = "2007 IEEE International Conference on Communications",
    chapter = "Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20101015-111219862",
    id = "record",
    isbn = "978-1-4244-0352-3",
    doi = "10.1109/ICC.2007.33"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170509-170830648,
    title = "2006 IEEE International Symposium on Information Theory",
    chapter = "Existence, Uniqueness, and Optimality of Sibling-Property Codes for Infinite Sources",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170509-170830648",
    id = "record",
    isbn = "1-4244-0505-X",
    doi = "10.1109/ISIT.2006.262089"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170508-174050826,
    title = "2006 IEEE International Symposium on Information Theory",
    chapter = "On the Performance of Sphere Decoding of Block Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170508-174050826",
    id = "record",
    isbn = "1-4244-0505-X",
    doi = "10.1109/ISIT.2006.261824"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170511-125313453,
    title = "2006 IEEE International Symposium on Information Theory",
    chapter = "AG Goppa Codes from Maximal Curves over determined Finite Fields of characteristic 2",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170511-125313453",
    id = "record",
    isbn = "1-4244-0505-X",
    doi = "10.1109/ISIT.2006.261891"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150319-085248418,
    title = "Decoding the universe: How the new science of information is explaining everything in the cosmos, from our brains to black holes [Book Review]",
    journal = "Nature",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150319-085248418",
    id = "record",
    issn = "0028-0836",
    doi = "10.1038/441409b",
    volume = "441"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:ELKieeejsac06,
    title = "Iterative algebraic soft-decision list decoding of Reed-Solomon codes",
    journal = "IEEE Journal on Selected Areas in Communications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:ELKieeejsac06",
    id = "record",
    issn = "0733-8716",
    doi = "10.1109/JSAC.2005.862399",
    volume = "24"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200204-111546794,
    title = "Applied Algebra, Algebraic Algorithms and Error-Correcting Codes",
    chapter = "On Generalized Parity Checks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200204-111546794",
    id = "record",
    isbn = "978-3-540-31423-3",
    doi = "10.1007/11617983\_2"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110616-134644787,
    title = "Fourth annual IEEE International Conference on Pervasive Computing and Communications Workshops",
    chapter = "A dynamic graph algorithm for the highly dynamic network problem",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110616-134644787",
    id = "record",
    isbn = "0-7695-2520-2",
    doi = "10.1109/PERCOMW.2006.5"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:ELKisit05,
    title = "2005 IEEE International Symposium on Information Theory (ISIT) : Adelaide, Australia, 4-9 September, 2005",
    chapter = "The partition weight enumerator of MDS codes and its applications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:ELKisit05",
    id = "record",
    isbn = "0-7803-9151-9"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110810-094621665,
    title = "2005 IEEE International Symposium on Information Theory",
    chapter = "Enumerators for protograph ensembles of LDPC codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110810-094621665",
    id = "record",
    isbn = "0-7803-9150-0",
    doi = "10.1109/ISIT.2005.1523728"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:YOKglobecom04,
    title = "IEEE Global Telecommunications Conference, GLOBECOM '04, 29 November-3 December 2004",
    chapter = "An optimization method for designing high rate and high performance SCTCM systems with in-line interleavers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:YOKglobecom04",
    id = "record",
    isbn = "0780387945"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:FLOieeejsac04,
    title = "Lower bounds on data collection time in sensory networks",
    journal = "IEEE Journal on Selected Areas in Communications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:FLOieeejsac04",
    id = "record",
    issn = "0733-8716",
    doi = "10.1109/JSAC.2004.830927",
    volume = "22"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110818-092750820,
    title = "2004 IEEE International Symposium on Information Theory",
    chapter = "Delay issues in linear sensory networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110818-092750820",
    id = "record",
    isbn = "0-7803-8280-3",
    doi = "10.1109/ISIT.2004.1365119"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:ELKisit04,
    title = "2004 IEEE International Symposium on Information Theory : proceedings : Chicago Downtown Marriott, Chicago, Illinois, USA, June 27-July 2, 2004",
    chapter = "Performance enhancements for algebraic soft decision decoding of Reed-Solomon codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:ELKisit04",
    id = "record",
    isbn = "0-7803-8280-3",
    doi = "10.1109/ISIT.2004.1365456"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110818-095939379,
    title = "2004 IEEE International Symposium on Information Theory",
    chapter = "Capacity of the Generalized PPM Channel",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110818-095939379",
    id = "record",
    isbn = "0-7803-8280-3",
    doi = "10.1109/ISIT.2004.1365371"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190205-155742864,
    title = "IEEE International Symposium on Information Theory, 2003. Proceedings.",
    chapter = "Poset belief propagation-experimental results",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190205-155742864",
    id = "record",
    isbn = "0780377281",
    doi = "10.1109/isit.2003.1228191"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111018-132205471,
    title = "2003 IEEE International Symposium on Information Theory",
    chapter = "Convergence analysis of SCCC and SCTCM with 'in-line' interleaver",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111018-132205471",
    id = "record",
    isbn = "0-7803-7728-1",
    doi = "10.1109/ISIT.2003.1228427"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:FLOinfocom03,
    title = "Joint Conference of the IEEE Computer and Communications Societies, 22nd, IEEE INFOCOM 2003, San Francisco, CA, 30 March-3 April 2003",
    chapter = "Packets distribution algorithms for sensor networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:FLOinfocom03",
    id = "record",
    isbn = "0-7803-7753-2"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200204-144202684,
    title = "Mathematical Systems Theory in Biology, Communications, Computation, and Finance",
    chapter = "Belief Propagation on Partially Ordered Sets",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200204-144202684",
    id = "record",
    isbn = "978-1-4419-2326-4",
    doi = "10.1007/978-0-387-21696-6\_10"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111102-092635109,
    title = "GLOBECOM'02: IEEE Global Telecommunications Conference",
    chapter = "Scheduling algorithms for wireless ad-hoc sensor networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111102-092635109",
    id = "record",
    isbn = "0-7803-7632-3",
    doi = "10.1109/GLOCOM.2002.1188031"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:JINieeetit02,
    title = "Coding theorems for turbo code ensembles",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:JINieeetit02",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2002.1003833",
    volume = "48"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200204-103116134,
    title = "Information, Coding and Mathematics: Proceedings of Workshop honoring Prof. Bob McEliece on his 60th birthday",
    chapter = "Results to get Maximal Quasihermitian Curves. New possibilities for AG Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200204-103116134",
    id = "record",
    isbn = "978-1-4419-5289-9",
    doi = "10.1007/978-1-4757-3585-7\_4"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111104-122318374,
    title = "2001 IEEE International Symposium on Information Theory",
    chapter = "On the complexity of reliable communication on the erasure channel",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111104-122318374",
    id = "record",
    isbn = "0-7803-7123-2",
    doi = "10.1109/ISIT.2001.935864"
}


@other{https://resolver.caltech.edu/CaltechCSTR:1985.5178-tr-85,
    title = "Submicron Systems Architecture: Semiannual Technical Report",
    url = "https://resolver.caltech.edu/CaltechCSTR:1985.5178-tr-85",
    id = "record",
    doi = "10.7907/7fbb9-smt37"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit01,
    title = "Permutations preserving divisibility",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit01",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.915685",
    volume = "47"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200204-145114201,
    title = "Codes, Systems, and Graphical Models",
    chapter = {BSC Thresholds for Code Ensembles Based on "Typical Pairs" Decoding},
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200204-145114201",
    id = "record",
    isbn = "978-0-387-95173-7",
    doi = "10.1007/978-1-4613-0165-3\_11"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111130-082915053,
    title = "2000 IEEE International Symposium on Information Theory",
    chapter = "General coding theorems for turbo-like codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111130-082915053",
    id = "record",
    isbn = "0-7803-5857-0",
    doi = "10.1109/ISIT.2000.866412"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190710-133740050,
    title = "Maximal codeword lengths in Huffman codes",
    journal = "Computers and Mathematics with Applications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190710-133740050",
    id = "record",
    issn = "0898-1221",
    doi = "10.1016/S0898-1221(00)00119-X",
    volume = "39"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111128-074933357,
    title = "2000 IEEE International Symposium on Information Theory",
    chapter = "AWGN Coding Theorems from Ensemble Weight Enumerators",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111128-074933357",
    id = "record",
    isbn = "0-7803-5858-9",
    doi = "10.1109/ISIT.2000.866757"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:AJIieeetit00,
    title = "The generalized distributive law",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:AJIieeetit00",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.825794",
    volume = "46"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200204-152225846,
    title = "Applied Algebra, Algebraic Algorithms and Error-Correcting Codes",
    chapter = "RA Codes Achieve AWGN Channel Capacity",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200204-152225846",
    id = "record",
    isbn = "978-3-540-66723-0",
    doi = "10.1007/3-540-46796-3\_2"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:HATieeetit98,
    title = "Subspace subcodes of Reed-Solomon codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:HATieeetit98",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.705564",
    volume = "44"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120119-094316404,
    title = "1998 IEEE International Symposium on Information Theory",
    chapter = "The Trellis Evolution Algorithm for Nonlinear Block Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120119-094316404",
    id = "record",
    isbn = "0-7803-5000-6",
    doi = "10.1109/ISIT.1998.708859"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111222-140131828,
    title = "1998 IEEE International Symposium on Information Theory",
    chapter = "Junction tree representations for linear block codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111222-140131828",
    id = "record",
    isbn = "0-7803-5000-6",
    doi = "10.1109/ISIT.1998.708858"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:MCEieeejsac98,
    title = {Turbo decoding as an instance of Pearl's "belief propagation" algorithm},
    journal = "IEEE Journal on Selected Areas in Communications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:MCEieeejsac98",
    id = "record",
    issn = "0733-8716",
    doi = "10.1109/49.661103",
    volume = "16"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:AJIitw98,
    title = "Information Theory Workshop, 1998 (ITW '98), Killarney, Ireland, 22-26 June 1998",
    chapter = "Iterative min-sum decoding of tail-biting codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:AJIitw98",
    id = "record",
    isbn = "0-7803-4408-1",
    doi = "10.1109/ITW.1998.706439"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:AJIisit98,
    title = "Proceedings, 1998 IEEE International Symposium on Information Theory (ISIT '98), Cambridge, MA, August 16-21, 1998",
    chapter = "Iterative decoding on graphs with a single cycle",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:AJIisit98",
    id = "record",
    isbn = "0-7803-5000-6",
    doi = "10.1109/ISIT.1998.708881"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120126-091409643,
    title = "1997 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing: PACRIM, 10 years, 1987-1997",
    chapter = "Gus' last theorem? Fast multiplication in GF (2^m)",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120126-091409643",
    id = "record",
    isbn = "0-7803-3906-1",
    doi = "10.1109/PACRIM.1997.620364"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120120-100255991,
    title = "1997 IEEE International Symposium on Information Theory, Proceedings",
    chapter = "Trellis-Canonical Generator Matrices for Convolutional Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120120-100255991",
    id = "record",
    isbn = "0-7803-3956-8",
    doi = "10.1109/ISIT.1997.613207"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120120-073411865,
    title = "1997 IEEE International Symposium on Information Theory, Proceedings",
    chapter = "Belief Propagation in Loopy Bayesian Networks: Experimental Results",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120120-073411865",
    id = "record",
    isbn = "0-7803-3956-8",
    doi = "10.1109/ISIT.1997.613147"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:AJIisit97,
    title = "Proceedings, 1997 IEEE International Symposium on Information Theory (ISIT '97), Ulm, Germany, June 29-July 4, 1997",
    chapter = "A general algorithm for distributing information in a graph",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:AJIisit97",
    id = "record",
    isbn = "0-7803-3956-8",
    doi = "10.1109/ISIT.1997.612921"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:YUZisit97,
    title = "IEEE International Symposium on Information Theory (ISIT 1997), Ulm, Germany, 29 June-4 July 1997",
    chapter = "Buffer occupancy of statistical multiplexers with periodic interchangeable traffic in ATM networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:YUZisit97",
    id = "record",
    isbn = "0780339568",
    doi = "10.1109/ISIT.1997.612946"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit96b,
    title = "The trellis complexity of convolutional codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit96b",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.556680",
    volume = "42"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:KIEieeetit96,
    title = "Trellis decoding complexity of linear block codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:KIEieeetit96",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.556665",
    volume = "42"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit96a,
    title = "On the BCJR trellis for linear block codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit96a",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.508834",
    volume = "42"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120131-132952348,
    title = "Effective free distance of turbo codes",
    journal = "Electronics Letters",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120131-132952348",
    id = "record",
    issn = "0013-5194",
    doi = "10.1049/el:19960321",
    volume = "32"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120216-101442622,
    title = "MILCOM '95: 14th Military communications conference",
    chapter = "Performance Analysis of Turbo Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120216-101442622",
    id = "record",
    isbn = "0-7803-2489-7",
    doi = "10.1109/MILCOM.1995.483278"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120223-102920927,
    title = "Proceedings 1995 IEEE International Symposium on Information Theory",
    chapter = "The trellis complexity of convolutional codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120223-102920927",
    id = "record",
    isbn = "0-7803-2453-6",
    doi = "10.1109/ISIT.1995.531335"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120223-100956421,
    title = "Proceedings 1995 IEEE International Symposium on Information Theory",
    chapter = "An Inequality On Entropy",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120223-100956421",
    id = "record",
    isbn = "0-7803-2453-6",
    doi = "10.1109/ISIT.1995.550316"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:CHEisit95b,
    title = "IEEE International Symposium on Information Theory (ISIT '95), Whistler, British Columbia, 17-22 September 1995",
    chapter = "Unit-memory Hamming turbo codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:CHEisit95b",
    id = "record",
    isbn = "0-7803-2453-6",
    doi = "10.1109/ISIT.1995.531135"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:CHEisit95a,
    title = "IEEE International Symposium on Information Theory (ISIT '95), Whistler, British Columbia, 17-22 September 1995",
    chapter = "Data expansion with Huffman codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:CHEisit95a",
    id = "record",
    isbn = "0-7803-2453-6",
    doi = "10.1109/ISIT.1995.531102"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:HATisit94,
    title = "Proceedings 1994 IEEE International Symposium on Information Theory : The Norwegian Institute of Technology, Trondheim, Norway, June 27 - July 1, 1994",
    chapter = "Subspace subcodes of Reed-Solomon codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:HATisit94",
    id = "record",
    isbn = "0780320158",
    doi = "10.1109/ISIT.1994.395045"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120221-092955129,
    title = "Proceedings 1994 IEEE International Symposium on Information Theory",
    chapter = "The Viterbi decoding complexity of linear block codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120221-092955129",
    id = "record",
    isbn = "0-7803-2015-8",
    doi = "10.1109/ISIT.1994.394677"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120222-134457817,
    title = "Proceedings 1994 IEEE International Symposium on Information Theory",
    chapter = "Counting minimal generator matrices",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120222-134457817",
    id = "record",
    isbn = "0-7803-2015-8",
    doi = "10.1109/ISIT.1994.394953"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit94,
    title = "Performance limits for channelized cellular telephone systems",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit94",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.272452",
    volume = "40"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:GOOieeetit93,
    title = "Phased burst error-correcting array codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:GOOieeetit93",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.212304",
    volume = "39"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120309-122814096,
    title = "1993 Proceedings of the International Symposium on Information Theory",
    chapter = "The Extended Invariant Factor Algorithm with Application to the Forney Analysis of Convolutional Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120309-122814096",
    id = "record",
    isbn = "0-7803-0878-6",
    doi = "10.1109/ISIT.1993.748457"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170601-145953562,
    title = "Proceedings. IEEE International Symposium on Information Theory",
    chapter = "A Comparison of CDMA and Frequency Hopping in a Cellular Environment",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170601-145953562",
    id = "record",
    isbn = "0-7803-0878-6",
    doi = "10.1109/ISIT.1993.748566"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:CHAieeetit92,
    title = "Performance of binary block codes at low signal-to-noise ratios",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:CHAieeetit92",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.165442",
    volume = "38"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120329-101208582,
    title = "Third IEEE International Symposium on Personal, Indoor and Mobile Radio Communications",
    chapter = "Heavy traffic performance of a class of channel assignment algorithms",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120329-101208582",
    id = "record",
    isbn = "0-7803-0841-7",
    doi = "10.1109/PIMRC.1992.279871"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120307-114648821,
    title = "1st International Conference on Universal Personal Communications, Proceedings (ICUPC '92)",
    chapter = "A Comparison of CDMA and Frequency Hopping in a Cellular Environment",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120307-114648821",
    id = "record",
    isbn = "0-7803-0591-4",
    doi = "10.1109/ICUPC.1992.240779"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120328-130309049,
    title = "Proceedings 1992 IEEE International Symposium on Circuits and Systems",
    chapter = "VLSI decompositions for deBruijn graphs",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120328-130309049",
    id = "record",
    isbn = "0-7803-0593-0",
    doi = "10.1109/ISCAS.1992.230451"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170622-133511273,
    title = "Proceedings. 1991 IEEE International Symposium on Information Theory",
    chapter = "Performance Limits For Cellular Multiuser Communication Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170622-133511273",
    id = "record",
    isbn = "0-7803-0056-4",
    doi = "10.1109/ISIT.1991.695261"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170620-143807037,
    title = "Proceedings. 1991 IEEE International Symposium on Information Theory",
    chapter = "Some Properties Of Memoryless Multiterminal Interference Channels",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170620-143807037",
    id = "record",
    isbn = "0-7803-0056-4",
    doi = "10.1109/ISIT.1991.695268"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170620-165537084,
    title = "Proceedings. 1991 IEEE International Symposium on Information Theory",
    chapter = "Asymptotic Performance Of Fixed And Dynamic Channel Assignment In Cellular Radio",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170620-165537084",
    id = "record",
    isbn = "0-7803-0056-4",
    doi = "10.1109/ISIT.1991.695210"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170620-150041378,
    title = "Proceedings. 1991 IEEE International Symposium on Information Theory",
    chapter = "Single Phased Burst Error Correcting Array Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170620-150041378",
    id = "record",
    isbn = "0-7803-0056-4",
    doi = "10.1109/ISIT.1991.695251"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190315-142359380,
    title = "Proceedings. 1991 IEEE International Symposium on Information Theory",
    chapter = "Some Partial Unit Memory Convolutional Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190315-142359380",
    id = "record",
    isbn = "0780300564",
    doi = "10.1109/isit.1991.695252"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120423-111348165,
    title = "1991 Third IEE Conference on Telecommunications",
    chapter = "Performance limits for FDMA cellular systems described by hypergraphs",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120423-111348165",
    id = "record",
    isbn = "0-85296-502-8"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120509-135031162,
    chapter = "Dynamic channel assignment in cellular radio",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120509-135031162",
    id = "record",
    doi = "10.1109/VETEC.1990.110396"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120524-153350625,
    chapter = "Truncation effects in Viterbi decoding",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120524-153350625",
    id = "record",
    doi = "10.1109/MILCOM.1989.103985"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120517-092808034,
    chapter = "Channel assignment in cellular radio",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120517-092808034",
    id = "record",
    doi = "10.1109/VETEC.1989.40173"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120216-080309345,
    chapter = "The undetected error probability for Reed-Solomon codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120216-080309345",
    id = "record",
    doi = "10.1109/MILCOM.1988.13385"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120531-153846714,
    title = "The Rényi Redundancy of Generalized Huffman Codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120531-153846714",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.21251",
    volume = "34"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:POLieeetit88,
    title = "Finite-state codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:POLieeetit88",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.21238",
    volume = "34"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:ABDieeetit88,
    title = "Two-dimensional burst identification codes and their use in burst correction",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:ABDieeetit88",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.6029",
    volume = "34"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:STAieeetit88,
    title = "On the capacity of channels with block memory",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:STAieeetit88",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.2642",
    volume = "34"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20200212-160015802,
    title = "A simple decision procedure for Hofstadter's Mitt-system",
    journal = "The Mathematical Intelligencer",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200212-160015802",
    id = "record",
    issn = "0343-6993",
    doi = "10.1007/bf03028356",
    volume = "10"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetc88,
    title = "The reliability of single-error protected computer memories",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetc88",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/12.75143",
    volume = "37"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200204-154400378,
    title = "Performance Limits in Communication Theory and Practice",
    chapter = "The Ultimate Limits of Information Density",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200204-154400378",
    id = "record",
    isbn = "978-94-010-7757-6",
    doi = "10.1007/978-94-009-2794-0\_16"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit87,
    title = "The capacity of the Hopfield associative memory",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit87",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.1987.1057328",
    volume = "33"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetc87,
    title = "A Note on the Wide-Band Gaussian Broadcast Channel",
    journal = "IEEE Transactions on Communications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetc87",
    id = "record",
    issn = "0090-6778",
    doi = "10.1109/TCOM.1987.1096784",
    volume = "35"
}


@other{https://resolver.caltech.edu/CaltechCSTR:1987.5240-tr-87,
    title = "Submicron Systems Architecture: Semiannual Technical Report",
    url = "https://resolver.caltech.edu/CaltechCSTR:1987.5240-tr-87",
    id = "record",
    doi = "10.7907/7cknj-w1w80"
}


@book{https://resolver.caltech.edu/CaltechAUTHORS:20200204-143509137,
    title = "Finite Fields for Computer Scientists and Engineers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200204-143509137",
    id = "record",
    isbn = "978-1-4612-9185-5",
    doi = "10.1007/978-1-4613-1983-2"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:ABDieeetit86,
    title = "On the existence of optimum cyclic burst-correcting codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:ABDieeetit86",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.1986.1057242",
    volume = "IT-32"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170718-172840654,
    chapter = "An Error-Control Code with an Imbalance of Ones and Zeros to Provide a Residual Carrier Component",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170718-172840654",
    id = "record",
    doi = "10.1109/MILCOM.1986.4805784"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit86b,
    title = "On the decoder error probability for Reed-Solomon codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit86b",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.1986.1057212",
    volume = "32"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit86a,
    title = "An entropy maximization problem related to optical communication",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit86a",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.1986.1057149",
    volume = "32"
}


@other{https://resolver.caltech.edu/CaltechCSTR:1986.5220-tr-86,
    title = "Submicron Systems Architecture: Semiannual Technical Report",
    url = "https://resolver.caltech.edu/CaltechCSTR:1986.5220-tr-86",
    id = "record",
    doi = "10.7907/rzewj-csb10"
}


@other{https://resolver.caltech.edu/CaltechCSTR:1986.5235-tr-86,
    title = "Submicron Systems Architecture: Semiannual Technical Report",
    url = "https://resolver.caltech.edu/CaltechCSTR:1986.5235-tr-86",
    id = "record",
    doi = "10.7907/my65t-e9565"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit85,
    title = "Coding protection for magnetic tapes: A generalization of the Patel-Hong code",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit85",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.1985.1057098",
    volume = "31"
}


@other{https://resolver.caltech.edu/CaltechCSTR:1985.5202-tr-85,
    title = "Submicron Systems Architecture: Semiannual Technical Report",
    url = "https://resolver.caltech.edu/CaltechCSTR:1985.5202-tr-85",
    id = "record",
    doi = "10.7907/mrh1j-cjp65"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200205-082507132,
    title = "The Impact of Processing Techniques on Communications",
    chapter = "Average-Case Optimized Buffered Decoders",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200205-082507132",
    id = "record",
    isbn = "978-94-010-8760-5",
    doi = "10.1007/978-94-009-5113-6\_9"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161026-163740202,
    title = "ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture",
    chapter = "Soft error correction for increased densities in VLSI memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161026-163740202",
    id = "record",
    isbn = "0-8186-0538-3",
    doi = "10.1145/800015.808191"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20161026-163747495,
    title = "Soft error correction for increased densities in VLSI memories",
    journal = "ACM SIGARCH Computer Architecture News",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161026-163747495",
    id = "record",
    issn = "0163-5964",
    doi = "10.1145/773453.808191",
    volume = "12"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:LORieeetc84,
    title = "Node Synchronization for the Viterbi Decoder",
    journal = "IEEE Transactions on Communications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:LORieeetc84",
    id = "record",
    issn = "0090-6778",
    doi = "10.1109/TCOM.1984.1096098",
    volume = "32"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit84,
    title = "Channels with block interference",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit84",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.1984.1056848",
    volume = "30"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190315-151103854,
    chapter = "A Study of Optimal Abstract Jamming Strategies vs. Noncoherent MFSK",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190315-151103854",
    id = "record",
    doi = "10.1109/MILCOM.1983.4794651"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200204-155745654,
    title = "Secure Digital Communications",
    chapter = "Communication in the Presence of Jamming-An Information-Theoretic Approach",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200204-155745654",
    id = "record",
    isbn = "978-3-211-81784-1",
    doi = "10.1007/978-3-7091-2640-0\_8"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190315-080818085,
    chapter = "The Optimal Code Rate vs. a Partial Band Jammer",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190315-080818085",
    id = "record",
    doi = "10.1109/MILCOM.1982.4805908"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190314-130609254,
    title = "Lifetime analyses of error-control coded semiconductor RAM systems",
    journal = "IEE Proceedings E Computers and Digital Techniques",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190314-130609254",
    id = "record",
    issn = "0143-7062",
    doi = "10.1049/ip-e.1982.0017",
    volume = "129"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit81,
    title = "Practical codes for photon communication",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit81",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.1981.1056380",
    volume = "27"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:COVieeetit81,
    title = "Asynchronous multiple-access channel capacity",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:COVieeetit81",
    id = "record",
    issn = "0018-9448",
    volume = "27"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120718-133007916,
    title = "Efficient Universal Noiseless Source Codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120718-133007916",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.1981.1056355",
    volume = "27"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BAUieeetit79,
    title = "Symbol synchronization in convolutionally coded systems",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BAUieeetit79",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.1979.1056044",
    volume = "25"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200205-110200018,
    title = "Algebraic Coding Theory and Applications",
    chapter = "Bounds of Delsarte and Lovász, and Their Applications to Coding Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200205-110200018",
    id = "record",
    isbn = "978-3-662-38752-8",
    doi = "10.1007/978-3-662-39641-4\_2"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BERieeetit78,
    title = "On the inherent intractability of certain coding problems",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BERieeetit78",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.1978.1055873",
    volume = "24"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:SHEieeetit77,
    title = "There is no MacWilliams identity for convolutional codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:SHEieeetit77",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.1977.1055785",
    volume = "23"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit77b,
    title = "An improved upper bound on the block coding error exponent for binary-input discrete memoryless channels",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit77b",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.1977.1055772",
    volume = "23"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit77a,
    title = "New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit77a",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.1977.1055688",
    volume = "23"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200204-104545745,
    title = "Combinatorics",
    chapter = "Irreducible Cyclic Codes and Gauss Sums",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200204-104545745",
    id = "record",
    isbn = "978-94-010-1828-9",
    doi = "10.1007/978-94-010-1826-5\_9"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:WELieeetit74,
    title = "A low-rate improvement on the Elias bound",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:WELieeetit74",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.1974.1055279",
    volume = "20"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BAUieeetit73,
    title = "A note on the Griesmer bound",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BAUieeetit73",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.1973.1054939",
    volume = "19"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit73,
    title = "Comments on 'A class of codes for axisymmetric channels and a problem from the additive theory of numbers' by Varshanov, R. R.",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit73",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.1973.1054941",
    volume = "19"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit70,
    title = "On the symmetry of good nonlinear codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit70",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.1970.1054508",
    volume = "16"
}