Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Lorenz Welter"'
Autor:
Issam Maarouf, Andreas Lenz, Lorenz Welter, Antonia Wachter-Zeh, Eirik Rosnes, Alexandre Graell i Amat
Publikováno v:
IEEE Transactions on Information Theory. 69:910-927
Decoding sequences that stem from multiple transmissions of a codeword over an insertion, deletion, and substitution channel is a critical component of efficient deoxyribonucleic acid (DNA) data storage systems. In this paper, we consider a concatena
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ba197abe02bc1190049938fc39672cd
https://doi.org/10.1109/tit.2022.3206527
https://doi.org/10.1109/tit.2022.3206527
Publikováno v:
ISIT
2021 IEEE International Symposium on Information Theory (ISIT)
2021 IEEE International Symposium on Information Theory (ISIT)
This paper investigates the problem of correcting multiple criss-cross deletions in arrays. More precisely, we study the unique recovery of $n\times n$ arrays affected by any combination of $t_{\mathrm{r}}$ row and $t_{\mathrm{c}}$ column deletions s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::baaeb2df4a92cf9df2cd34c30c1d1cce
https://doi.org/10.1109/isit45174.2021.9517743
https://doi.org/10.1109/isit45174.2021.9517743
This paper investigates the problem of correcting multiple criss-cross insertions and deletions in arrays. More precisely, we study the unique recovery of $n \times n$ arrays affected by $t$-criss-cross deletions defined as any combination of $t_r$ r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5bda2a1cc8c83d193b72ed7ee370f191
http://arxiv.org/abs/2102.02727
http://arxiv.org/abs/2102.02727
Publikováno v:
2020 IEEE Information Theory Workshop (ITW)
ITW
ITW
In this paper, a new problem of transmitting information over the adversarial insertion-deletion channel with feedback is introduced. Suppose that the encoder transmits $n$ binary symbols one-by-one over a channel, in which some symbols can be delete
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7927a2d69390b75507f60c02fd05e56
This paper studies the problem of constructing codes correcting deletions in arrays. Under this model, it is assumed that an $n\times n$ array can experience deletions of rows and columns. These deletion errors are referred to as $(t_r,t_c)$-criss-cr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb01ae5970e56492a62583f749df30d6
Publikováno v:
2020 IEEE International Symposium on Information Theory (ISIT)
ISIT
ISIT
Correcting insertions/deletions as well as substitution errors simultaneously plays an important role in DNA-based storage systems as well as in classical communications. This paper deals with the fundamental task of constructing codes that can corre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e612a61b67dc0834b8921f519069766d