Wang, F.Aktaş, DefneDuman, T. M.2016-02-082016-02-082011http://hdl.handle.net/11693/28264Date of Conference: 28-30 September 2011Conference Name: 49th Annual Allerton Conference on Communication, Control, and Computing, IEEE 2011We consider binary deletion channels with a segmentation assumption which appears to be suited for more practical scenarios. Unlike the binary independent and identically distributed (i.i.d.) deletion channel where each bit is independently deleted with an equal probability, the segmentation assumption prohibits certain transmitted bits to be deleted, i.e., in a block of bits of a certain length, only a limited number of deletions can occur. We first propose several upper and lower capacity bounds for the segmented deletion channel. Then we focus on an interleaved concatenation of an outer low-density parity check (LDPC) code with error-correction capabilities and an inner marker code with synchronization capabilities over these channels. With the help of a specifically designed maximum-a-posteriori (MAP) detector, we demonstrate reliable transmission at higher code rates than the existing ones reported in the literature.EnglishCode ratesEqual probabilityLow-density parity-check codesMarker codesMaximum a posterioriReliable transmissionSynchronization capabilityUpper and lower capacity boundsCommunicationCodes (symbols)Conference Paper10.1109/Allerton.2011.6120332