Sequence reconstruction for deletions
A code is (l, N)-reconstructible if for all pairs of codewords in a code, the number of distinct subsequences of length l is at most N - 1. In this work, we consider the sequence reconstruction problem introduced by Levenshtein. In particular, we study the reconstruction properties of 2-dimensional...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
Nanyang Technological University
2023
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/166487 |