{"id":5004,"date":"2015-09-05T08:11:42","date_gmt":"2015-09-05T06:11:42","guid":{"rendered":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/?p=5004"},"modified":"2015-09-05T08:11:43","modified_gmt":"2015-09-05T06:11:43","slug":"resena-formalization-of-error-correcting-codes-from-hamming-to-modern-coding-theory","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/resena-formalization-of-error-correcting-codes-from-hamming-to-modern-coding-theory\/","title":{"rendered":"Rese\u00f1a: Formalization of error-correcting codes (from Hamming to modern coding theory)"},"content":{"rendered":"<p>Se ha publicado un art\u00edculo de razonamiento formalizado en <a href=\"http:\/\/coq.inria.fr\">Coq<\/a> sobre codificaci\u00f3n titulado <a href=\"http:\/\/www.springer.com\/cda\/content\/document\/cda_downloaddocument\/9783319221014-c2.pdf\">Formalization of error-correcting codes (from Hamming to modern coding theory)<\/a><\/p>\n<p>Sus autores son<\/p>\n<ul>\n<li><a href=\"https:\/\/staff.aist.go.jp\/reynald.affeldt\/\">Reynald Affeldt<\/a> (del <a href=\"http:\/\/bit.ly\/1Kwq0gn\">AIST (National Institute of Advanced Industrial Science and Technology)<\/a> en Tsukuba, Jap\u00f3n) y<\/li>\n<li><a href=\"http:\/\/www.math.nagoya-u.ac.jp\/~garrigue\/\">Jacques Garrigue<\/a> (de la <a href=\"http:\/\/bit.ly\/1KwqenS\">Universidad de Nagoya<\/a> en Nagoya, Jap\u00f3n).<\/li>\n<\/ul>\n<p>Su resumen es<\/p>\n<blockquote><p>\n  By adding redundancy to transmitted data, error-correcting codes (ECCs) make it possible to communicate reliably over noisy channels. Minimizing redundancy and (de)coding time has driven much research, culminating with Low-Density Parity-Check (LDPC) codes. At first sight, ECCs may be considered as a trustful piece of computer systems because classical results are well-understood. But ECCs are also performance-critical so that new hardware calls for new implementations whose testing is always an issue. Moreover, research about ECCs is still flourishing with papers of ever-growing complexity. In order to provide means for implementers to perform verification and for researchers to firmly assess recent advances, we have been developing a formalization of ECCs using the SSReflect extension of the Coq proof-assistant. We report on the formalization of linear ECCs, duly illustrated with a theory about the celebrated Hamming codes and the verification of the sum-product algorithm for decoding LDPC codes.\n<\/p><\/blockquote>\n<p>El trabajo se present\u00f3 el 25 de agosto en el <a href=\"http:\/\/www.inf.kcl.ac.uk\/staff\/urbanc\/itp-2015\">ITP 2015<\/a> (<em>The 6th conference on Interactive Theorem Proving<\/em>).<\/p>\n<p>El c\u00f3digo de las correspondientes teor\u00edas en Coq se encuentra <a href=\"https:\/\/staff.aist.go.jp\/reynald.affeldt\/ecc\/\">aqu\u00ed<\/a>.<\/p>\n<p>Este art\u00edculo puede servir de lectura complementaria en los cursos de <a href=\"http:\/\/www.cs.us.es\/~jalonso\/cursos\/m-ra\">Razonamiento autom\u00e1tico<\/a>, <a href=\"http:\/\/www.cs.us.es\/cursos\/rac\/\">Razonamiento asistido por ordenador<\/a> y <em>L\u00f3gica computacional y teor\u00eda de modelos<\/em>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Se ha publicado un art\u00edculo de razonamiento formalizado en Coq sobre codificaci\u00f3n titulado Formalization of error-correcting codes (from Hamming to modern coding theory) Sus autores son Reynald Affeldt (del AIST (National Institute of Advanced Industrial Science and Technology) en Tsukuba, Jap\u00f3n) y Jacques Garrigue (de la Universidad de Nagoya en Nagoya, Jap\u00f3n). Su resumen es&#8230;<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"footnotes":"","_jetpack_memberships_contains_paid_content":false},"categories":[100],"tags":[45,285],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_likes_enabled":false,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/5004"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/comments?post=5004"}],"version-history":[{"count":1,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/5004\/revisions"}],"predecessor-version":[{"id":5005,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/5004\/revisions\/5005"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/media?parent=5004"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/categories?post=5004"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/tags?post=5004"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}