@other{https://resolver.caltech.edu/CaltechAUTHORS:20191004-150559432, title = "On Codes for Optimal Rebuilding Access", url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-150559432", id = "record", doi = "10.48550/arXiv.1107.1627" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20170315-151626957, title = "Switch Codes: Codes for Fully Parallel Reconstruction", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170315-151626957", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2017.2664867", volume = "63" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20170119-080421044, title = "Optimal Rebuilding of Multiple Erasures in MDS Codes", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170119-080421044", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2016.2633411", volume = "63" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20160930-131654865, title = "Explicit Minimum Storage Regenerating Codes", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20160930-131654865", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2016.2553675", volume = "62" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20160120-152728882, title = "Explicit MDS Codes for Optimal Repair Bandwidth", url = "https://resolver.caltech.edu/CaltechAUTHORS:20160120-152728882", id = "record", doi = "10.48550/arXiv.1411.6328" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20140425-151109319, title = "Access Versus Bandwidth in Codes for Storage", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140425-151109319", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2014.2305698", volume = "60" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20130321-102330661, title = "Zigzag Codes: MDS Array Codes With Optimal Rebuilding", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20130321-102330661", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2012.2227110", volume = "59" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20130128-153803180, title = "Codes for Network Switches", url = "https://resolver.caltech.edu/CaltechAUTHORS:20130128-153803180", id = "record" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20130204-132322886, title = "2012 IEEE International Symposium on Information Theory", chapter = "Long MDS Codes for Optimal Repair Bandwidth", url = "https://resolver.caltech.edu/CaltechAUTHORS:20130204-132322886", id = "record", isbn = "978-1-4673-2579-0", doi = "10.1109/ISIT.2012.6283041" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120829-092120549, title = "2012 IEEE International Symposium on Information Theory Proceedings (ISIT)", chapter = "Access vs. Bandwidth in Codes for Storage", url = "https://resolver.caltech.edu/CaltechAUTHORS:20120829-092120549", id = "record", isbn = "978-1-4673-2580-6", doi = "10.1109/ISIT.2012.6283042" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120829-103740126, title = "2012 IEEE International Symposium on Information Theory Proceedings (ISIT)", chapter = "Long MDS Codes for Optimal Repair Bandwidth", url = "https://resolver.caltech.edu/CaltechAUTHORS:20120829-103740126", id = "record", isbn = "978-1-4673-2580-6", doi = "10.1109/ISIT.2012.6283041" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20120616-221646611, title = "Long MDS Codes for Optimal Repair Bandwidth", url = "https://resolver.caltech.edu/CaltechAUTHORS:20120616-221646611", id = "record" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20120502-130441311, title = "Patterned Cells for Phase Change Memories", url = "https://resolver.caltech.edu/CaltechAUTHORS:20120502-130441311", id = "record" } @other{https://resolver.caltech.edu/CaltechPARADISE:2011.ETR111, title = "On Codes for Optimal Rebuilding Access", url = "https://resolver.caltech.edu/CaltechPARADISE:2011.ETR111", id = "record", doi = "10.48550/arXiv.1107.1627" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170213-160905267, title = "2011 IEEE International Symposium on Information Theory Proceedings", chapter = "Patterned cells for phase change memories", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170213-160905267", id = "record", isbn = "978-1-4577-0595-3", doi = "10.1109/ISIT.2011.6033979" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120406-093959188, title = "2011 IEEE International Symposium on Information Theory Proceedings", chapter = "MDS Array Codes with Optimal Rebuilding", url = "https://resolver.caltech.edu/CaltechAUTHORS:20120406-093959188", id = "record", isbn = "978-1-4577-0596-0", doi = "10.1109/ISIT.2011.6033733" } @other{https://resolver.caltech.edu/CaltechPARADISE:2011.ETR110, title = "MDS Array Codes with Optimal Rebuilding", url = "https://resolver.caltech.edu/CaltechPARADISE:2011.ETR110", id = "record", doi = "10.48550/arXiv.1103.3737" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110707-082718436, title = "2010 IEEE GLOBECOM Workshops", chapter = "Rebuilding for Array Codes in Distributed Storage Systems", url = "https://resolver.caltech.edu/CaltechAUTHORS:20110707-082718436", id = "record", isbn = "978-1-4244-8863-6", doi = "10.1109/GLOCOMW.2010.5700274" } @other{https://resolver.caltech.edu/CaltechPARADISE:2010.ETR103, title = "Rebuilding for Array Codes in Distributed Storage Systems", url = "https://resolver.caltech.edu/CaltechPARADISE:2010.ETR103", id = "record" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110331-130545474, title = "2010 IEEE International Symposium on Information Theory", chapter = "Partial Rank Modulation for Flash Memories", url = "https://resolver.caltech.edu/CaltechAUTHORS:20110331-130545474", id = "record", isbn = "978-1-4244-7891-0", doi = "10.1109/ISIT.2010.5513597" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100816-142932373, title = "ISIT 2009", chapter = "On the capacity of bounded rank modulation for flash memories", url = "https://resolver.caltech.edu/CaltechAUTHORS:20100816-142932373", id = "record", isbn = "978-1-4244-4312-3", doi = "10.1109/ISIT.2009.5205972" } @other{https://resolver.caltech.edu/CaltechPARADISE:2008.ETR091, title = "On the capacity of bounded rank modulation for flash memories", url = "https://resolver.caltech.edu/CaltechPARADISE:2008.ETR091", id = "record" }