Tutorial on algebraic deletion correction codes
From MaRDI portal
Publication:6320724
arXiv1906.07887MaRDI QIDQ6320724
Author name not available (Why is that?)
Publication date: 18 June 2019
Abstract: The deletion channel is known to be a notoriously diffcult channel to design error-correction codes for. In spite of this difficulty, there are some beautiful code constructions which give some intuition about the channel and about what good deletion codes look like. In this tutorial we will take a look at some of them. This document is a transcript of my talk at the coding theory reading group on some interesting works on deletion channel. It is not intended to be an exhaustive survey of works on deletion channel, but more as a tutorial to some of the important and cute ideas in this area. For a comprehensive survey, we refer the reader to the cited sources and surveys. We also provide an implementation of VT codes that correct single insertion/deletion errors for general alphabets at https://github.com/shubhamchandak94/VT_codes/.
Has companion code repository: https://github.com/shubhamchandak94/VT_codes
This page was built for publication: Tutorial on algebraic deletion correction codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6320724)
