Construction and redundancy of codes for correcting deletable errors

arXiv1805.00776MaRDI QIDQ6301074FDOQ6301074

Authors: Ghurumuruhan Ganesan 

Publication date: 29 April 2018

Abstract: Consider a binary word being transmitted through a communication channel that introduces deletable errors where each bit of the word is either retained, flipped, erased or deleted. The simplest code for correcting emph{all} possible deletable error patterns of a fixed size is the repetition code whose redundancy grows linearly with the code length. In this paper, we relax this condition and construct codes capable of correcting emph{nearly} all deletable error patterns of a fixed size, with redundancy growing as a logarithm of the word length.

This page was built for publication: Construction and redundancy of codes for correcting deletable errors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6301074)