@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" } @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" } @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" } @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" } @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" } @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" } @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" } @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" } @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" } @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: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: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" } @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" } @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" } @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: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: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: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: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: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" } @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" } @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" } @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" } @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" } @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" } @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: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: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: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" } @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" } @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: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: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: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" }