Name
Abstract | ||
|---|---|---|
Guess & check (GC) codes can correct multiple deletions with high probability by guessing all possible deletion patterns at a polynomial complexity. This paper investigates an efficient way of guessing deletion patterns with the aid of markers. The marker are inserted as block identifiers into GC codewords and examined for implementing maximum-likelihood inference of deletion patterns in trellis graph. The resulting number of guesses for decoding marker GC codes can be reduced significantly by an increasing order of magnitude as the code length grows. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/LCOMM.2021.3084853 | IEEE Communications Letters |
Keywords | DocType | Volume |
Deletion-correcting codes,guess & check codes,marker codes,maximum likelihood,trellis | Journal | 25 |
Issue | ISSN | Citations |
8 | 1089-7798 | 1 |
PageRank | References | Authors |
0.37 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guochen Ma | 1 | 1 | 0.70 |
| Xiaopeng Jiao | 2 | 38 | 9.90 |
| Jianjun Mu | 3 | 8 | 3.23 |
| Yu-cheng He | 4 | 53 | 10.01 |
| Hui Han | 5 | 14 | 7.99 |