A Generalized Half-Singleton Bound for List Decoding of Insertion/Deletion Errors
It is shown that a linear code can list decode from at most $n - \frac{L}{L+1}k + 1$ insdel errors with fixed list size with fixed list size.
AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
2 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
It is shown that a linear code can list decode from at most $n - \frac{L}{L+1}k + 1$ insdel errors with fixed list size with fixed list size.
We study linear codes for insertion and deletion (insdel) errors through the lens of evaluation codes. We develop a general framework for analyzing random puncturings of evaluation codes, where the edit distance is controlled by only the size of the evaluation domain and the maximum number of zeros of a nonzero functio...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.