Concatenated Codes for Deletion Channels

DSpace/Manakin Repository

Concatenated Codes for Deletion Channels

Citable link to this page

 

 
Title: Concatenated Codes for Deletion Channels
Author: Chen, Johnny; Mitzenmacher, Michael D.; Ng, Chaki; Varnica, Nedeljko

Note: Order does not necessarily reflect citation order of authors.

Citation: Chen, Johnny, Michael Mitzenmacher, Chaki Ng, and Nedeljko Varnica. 2003. Concatenated Codes for Deletion Channels. Harvard Computer Science Group Technical Report TR-07-03.
Full Text & Related Files:
Abstract: We design concatenated codes suitable for the deletion channel. The inner code is a combination of a single deletion correcting Varshamov-Tenengolts block code and a marker code. The outer code is a low-density parity-check (LDPC) code. The inner decoder detects the synchronizing points in the receive symbol sequence and feeds the outer LPDC decoder with soft information. Even using regular LPC codes as outer odes our results are promising. Our simulation results demonstrate that bit error rates of 10^-6 can be obtained at rate 0.21 when the probability of deletion is 8%.
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:24019792
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)

 
 

Search DASH


Advanced Search
 
 

Submitters