Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Sagi Marcovich"'
Publikováno v:
IEEE Transactions on Information Theory. 69:2923-2939
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e565fb653ce1228e044d2341977778c2
https://doi.org/10.1109/tit.2022.3227467
https://doi.org/10.1109/tit.2022.3227467
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d798dbc73caf42aa37aa349eeaf7028
https://doi.org/10.1109/isit50566.2022.9834560
https://doi.org/10.1109/isit50566.2022.9834560
This paper introduces a new family of reconstruction codes which is motivated by applications in DNA data storage and sequencing. In such applications, DNA strands are sequenced by reading some subset of their substrings. While previous works conside
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bfa1450c4a498ced0621a44fd591a13c
We study the adversarial torn-paper channel. This problem is motivated by applications in DNA data storage where the DNA strands that carry information may break into smaller pieces which are received out of order. Our model extends the previously re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f195a8118c83384bd54ee807395b28f1
Publikováno v:
ISIT
The de Bruijn graph and its sequences have found many diverse applications in information theory as well as other areas of computer science and engineering such as interconnection networks, VLSI decomposition, and most recently in DNA storage. Binary
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a2c61fea467c0c8c62c1e76535c8e2d
https://doi.org/10.1109/isit45174.2021.9517873
https://doi.org/10.1109/isit45174.2021.9517873
Autor:
Sagi Marcovich, Eitan Yaakobi
This paper studies two families of constraints for two-dimensional and multidimensional arrays. The first family requires that a multidimensional array will not contain a cube of zeros of some fixed size and the second constraint imposes that there w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c4970992cd0aa7a1e871ecb90475e17
http://arxiv.org/abs/2102.00519
http://arxiv.org/abs/2102.00519
Autor:
Yeow Meng Chee, Van Khu Vu, Tuvi Etzion, Han Mao Kiah, Eitan Yaakobi, Sagi Marcovich, Alexander Vardy
The de Bruijn graph, its sequences, and their various generalizations, have found many applications in information theory, including many new ones in the last decade. In this paper, motivated by a coding problem for emerging memory technologies, a se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8df44332f5410405129d3c7b144abb36
https://hdl.handle.net/10356/163774
https://hdl.handle.net/10356/163774
Autor:
Eitan Yaakobi, Sagi Marcovich
Publikováno v:
ISIT
This paper studies reconstruction of strings based upon their substrings spectrum. Under this paradigm, it is assumed that all substrings of some fixed length are received and the goal is to reconstruct the string. While many existing works assumed t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::74a62dea98e5410ae37ec58b45983065
Publikováno v:
2021 IEEE Information Theory Workshop (ITW)
ITW
ITW
The problem of string reconstruction based on its substrings spectrum has received significant attention recently due to its applicability to DNA data storage and sequencing. In contrast to previous works, we consider in this paper a setup of this pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c67661c5bba68ab2d5508f91ce07e496
Autor:
Chee, Yeow Meng, Etzion, Tuvi, Kiah, Han Mao, Marcovich, Sagi, Vardy, Alexander, Khu Vu, Van, Yaakobi, Eitan
Publikováno v:
IEEE Transactions on Information Theory; Dec2021, Vol. 67 Issue 12, p7857-7875, 19p