.png){kind=icon}
.png){kind=icon}
Return
Maximum-Likelihood Deletion Error Location for Decoding Marker Guess & Check Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2021.3084853.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Maximum likelihood decoding
Encoding
Systematics
Complexity theory
Electronic mail
Watermarking
Redundancy
Deletion-correcting codes
guess & check codes
marker codes
maximum likelihood
trellis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W