On capacity and coding for segmented deletion channels

dc.citation.epage1413en_US
dc.citation.spage1408en_US
dc.contributor.authorWang, F.en_US
dc.contributor.authorAktaş, Defneen_US
dc.contributor.authorDuman, T. M.en_US
dc.coverage.spatialMonticello, IL, USAen_US
dc.date.accessioned2016-02-08T12:15:47Z
dc.date.available2016-02-08T12:15:47Z
dc.date.issued2011en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.descriptionDate of Conference: 28-30 September 2011en_US
dc.descriptionConference Name: 49th Annual Allerton Conference on Communication, Control, and Computing, IEEE 2011en_US
dc.description.abstractWe 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.en_US
dc.identifier.doi10.1109/Allerton.2011.6120332en_US
dc.identifier.urihttp://hdl.handle.net/11693/28264
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/Allerton.2011.6120332en_US
dc.source.titleProceedings of the 49th Annual Allerton Conference on Communication, Control, and Computing, IEEE 2011en_US
dc.subjectCode ratesen_US
dc.subjectEqual probabilityen_US
dc.subjectLow-density parity-check codesen_US
dc.subjectMarker codesen_US
dc.subjectMaximum a posteriorien_US
dc.subjectReliable transmissionen_US
dc.subjectSynchronization capabilityen_US
dc.subjectUpper and lower capacity boundsen_US
dc.subjectCommunicationen_US
dc.subjectCodes (symbols)en_US
dc.titleOn capacity and coding for segmented deletion channelsen_US
dc.typeConference Paperen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
On capacity and coding for segmented deletion channels.pdf
Size:
405.75 KB
Format:
Adobe Portable Document Format
Description:
Full printable version