Zobrazeno 1 - 10
of 217
pro vyhledávání: '"Alexander Vardy"'
Publikováno v:
Entropy, Vol 23, Iss 7, p 841 (2021)
Polar coding gives rise to the first explicit family of codes that provably achieve capacity with efficient encoding and decoding for a wide range of channels. However, its performance at short blocklengths under standard successive cancellation deco
Externí odkaz:
https://doaj.org/article/f05dc48573ae4a2da6568c6c99d0390b
Publikováno v:
Forum of Mathematics, Pi, Vol 4 (2016)
Let $\mathbb{F}_{q}^{n}$ be a vector space of dimension $n$ over the finite field $\mathbb{F}_{q}$ . A $q$ -analog of a Steiner system (also known as a $q$ -Steiner system), denoted ${\mathcal{S}}_{q}(t,\!k,\!n)$ , is a set ${\mathcal{S}}$ of
Externí odkaz:
https://doaj.org/article/21c15632662a4bd5a3b460bb1d247339
Autor:
Alexander Vardy, Johan Chrisnata, Hanwen Yao, Sankeerth Rao Karingula, Eitan Yaakobi Yao, Han Mao Kiah
Publikováno v:
Advances in Mathematics of Communications. 17:960-978
The \begin{document}$ k $\end{document} -deck of a sequence is defined as the multiset of all its subsequences of length \begin{document}$ k $\end{document} . Let \begin{document}$ D_k(n) $\end{document} denote the number of distinct \begin{document}
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Polar code visibly approaches channel capacity in practice and is thereby a constituent code of the 5G standard. Compared to low-density parity-check code, however, the performance of short-length polar code has rooms for improvement that could hinde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae652d4979c87579b383bae9cfe9f313
http://arxiv.org/abs/2204.11683
http://arxiv.org/abs/2204.11683
Publikováno v:
IEEE Transactions on Information Theory. 66:2669-2682
Write-once memory (WOM) is a storage device consisting of binary cells that can only increase their levels. A $t$ -write WOM code is a coding scheme that makes it possible to write $t$ times to a WOM without decreasing the levels of any of the cells.
Publikováno v:
IEEE Transactions on Information Theory. :1-1
Publikováno v:
2021 IEEE Globecom Workshops (GC Wkshps).