Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Van Khu Vu"'
Publikováno v:
2022 IEEE Information Theory Workshop (ITW).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7fb8415f3bd2ffe0e0271a00d872583
https://doi.org/10.1109/itw54588.2022.9965921
https://doi.org/10.1109/itw54588.2022.9965921
Publikováno v:
IEEE Communications Letters. 25:1435-1438
This letter proposes novel methods for designing two-dimensional (2-D) weight-constrained codes for reducing the parasitic currents in the crossbar resistive memory array. In particular, we present efficient encoding/decoding algorithms for capacity-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7b08c5259319e72ffa875ff227445886
https://doi.org/10.1109/lcomm.2021.3050159
https://doi.org/10.1109/lcomm.2021.3050159
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c3710c3d0257cded7de4967fe8645c5
https://doi.org/10.1109/isit50566.2022.9834611
https://doi.org/10.1109/isit50566.2022.9834611
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83c2cfaff29da6acda811c182f3cb43f
https://doi.org/10.1109/isit50566.2022.9834761
https://doi.org/10.1109/isit50566.2022.9834761
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7fa24cec12fbe36fed5864587d52ef8
https://doi.org/10.1109/isit50566.2022.9834795
https://doi.org/10.1109/isit50566.2022.9834795
Publikováno v:
IEEE Transactions on Information Theory. 66:957-969
Permutation codes and multipermutation codes are widely studied due to various applications in information theory. Designing codes correcting deletion errors has been the main subject of works in the literature and to the best of our knowledge, there
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9d40279599f71a35d4039cf670c20fc
https://doi.org/10.1109/tit.2019.2933819
https://doi.org/10.1109/tit.2019.2933819
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
\emph{Resistive memories}, such as \emph{phase change memories} and \emph{resistive random access memories} have attracted significant attention in recent years due to their better scalability, speed, rewritability, and yet non-volatility. However, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::931b35687c36a3004593be775d5d35be
http://arxiv.org/abs/2109.09932
http://arxiv.org/abs/2109.09932
Publikováno v:
ISIT
Transverse-read is a novel technique to detect the number of ‘1's stored in domain wall memory, also known as racetrack memory, without shifting any domains. Motivated by this technique, we propose a novel scheme to combine transverse-read and shif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6103484246084e1da04df396916b3fc0
https://doi.org/10.1109/isit45174.2021.9518271
https://doi.org/10.1109/isit45174.2021.9518271
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