Concatenated Codes for Deletion Channels
MetadataShow full item record
CitationChen, Johnny, Michael Mitzenmacher, Chaki Ng, and Nedeljko Varnica. 2003. Concatenated Codes for Deletion Channels. Harvard Computer Science Group Technical Report TR-07-03.
AbstractWe 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%.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:24019792
- FAS Scholarly Articles