{"607600":{"#nid":"607600","#data":{"type":"event","title":"ARC-TRIAD Colloquium: Mary Wootters (Stanford)","body":[{"value":"\u003Cp align = \u0022center\u0022\u003E\u003Cstrong\u003EARC-TRIAD Colloquium\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp align = \u0022center\u0022\u003E\u003Cstrong\u003EMary Wootters\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp align = \u0022center\u0022\u003E\u003Cstrong\u003EMonday, October 1, 2018\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp align = \u0022center\u0022\u003E\u003Cstrong\u003EMiRC Pettit 102A\u0026amp;B - 11:00 am\u003C\/strong\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003ETitle:\u0026nbsp; \u003C\/strong\u003EImproved Decoding of Folded Reed-Solomon and Multiplicity Codes\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cstrong\u003EAbstract:\u003C\/strong\u003E\u0026nbsp; List-decoding is an important primitive in the theory of error correcting codes, and it has long been a goal to obtain explicit constructions of capacity-achieving, efficiently list-decodable codes.\u0026nbsp; Folded Reed-Solomon Codes (Guruswami-Rudra 2008) and Multiplicity codes (Guruswami-Wang 2011, Kopparty 2012) are two such constructions.\u0026nbsp; However, previous analysis of these codes could not guarantee optimal parameters.\u0026nbsp; In particular, the \u0026ldquo;list-size\u0026rdquo; of these codes was only shown to be polynomial, while ideally it would be constant.\u0026nbsp; Thus, over the past decade or so, there have been several modifications of these codes aimed at reducing the list size to constant.\u0026nbsp; In this work, we show that in fact the list-sizes were constant all along, with no modifications required!\u0026nbsp; Further, we use our result for univariate multiplicity codes to establish improved local list-decoding results for multivariate multiplicity codes.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EIn this talk, I\u0026rsquo;ll define all the terms in the paragraph above (in particular, no prior knowledge of error correcting codes is necessary!), and sketch the proofs of the results mentioned above.\u003C\/p\u003E\r\n\r\n\u003Cp\u003EJoint work with Swastik Kopparty, Noga Ron-Zewi, and Shubhangi Saraf.\u003C\/p\u003E\r\n\r\n\u003Cp\u003E----------------------------------\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Ca href=\u0022https:\/\/sites.google.com\/site\/marywootters\/\u0022\u003ESpeaker\u0026#39;s Webpage\u003C\/a\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Cem\u003EVideos of recent talks are available at: \u003C\/em\u003E\u003Ca href=\u0022https:\/\/smartech.gatech.edu\/handle\/1853\/46836\u0022\u003E\u003Cem\u003Ehttps:\/\/smartech.gatech.edu\/handle\/1853\/46836\u003C\/em\u003E\u003C\/a\u003E\u003C\/p\u003E\r\n\r\n\u003Cp\u003E\u003Ca href=\u0022https:\/\/mailman.cc.gatech.edu\/mailman\/listinfo\/arc-colloq\u0022\u003E\u003Cem\u003EClick here to subscribe to the seminar email list: arc-colloq@cc.gatech.edu \u003C\/em\u003E\u003C\/a\u003E\u003C\/p\u003E\r\n","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Improved Decoding of Folded Reed-Solomon and Multiplicity Codes - MiRC Pettit 102 A\u0026B at 11 am"}],"uid":"27544","created_gmt":"2018-07-10 14:31:26","changed_gmt":"2018-10-01 13:10:14","author":"Francella Tonge","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2018-10-01T12:00:00-04:00","event_time_end":"2018-10-01T13:00:00-04:00","event_time_end_last":"2018-10-01T13:00:00-04:00","gmt_time_start":"2018-10-01 16:00:00","gmt_time_end":"2018-10-01 17:00:00","gmt_time_end_last":"2018-10-01 17:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1792","name":"Arts and Performance"},{"id":"1795","name":"Seminar\/Lecture\/Colloquium"}],"invited_audience":[{"id":"177814","name":"Postdoc"},{"id":"174045","name":"Graduate students"},{"id":"78751","name":"Undergraduate students"}],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}}}