Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Wentu Song"'
Publikováno v:
IEEE Transactions on Information Theory. 68:6402-6416
Publikováno v:
IEEE Systems Journal. 16:197-208
We investigate a basic decentralized caching network with coded prefetching under nonuniform requests and arbitrary file popularities, where a server containing $N$ files is connected to $K$ users, each with limited cache memory of $M$ files through
Publikováno v:
IEEE Transactions on Communications. 69:3638-3651
In this paper, under a general cost function $C$, we present a dynamic programming (DP) method to obtain an optimal sequential deterministic quantizer (SDQ) for $q$-ary input discrete memoryless channel (DMC). The DP method has complexity $O(q (N-M)^
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Publikováno v:
IEEE Transactions on Information Theory. 66:6809-6822
We design $p$ - reconstructible $\mu $ - secure $[n,k]$ erasure coding schemes $(0 \leq \mu , which encode $k-\mu $ information symbols into $n$ coded symbols and moreover, satisfy the $k$ -out-of- $n$ property and the following two properties: (P1)
In this paper, we present an explicit construction of list-decodable codes for single-deletion and single-substitution with list size two and redundancy 3log n+4, where n is the block length of the code. Our construction has lower redundancy than the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dd73869a9bea9738dd2fad236eb950ed
http://arxiv.org/abs/2201.02013
http://arxiv.org/abs/2201.02013
Publikováno v:
ISIT
In this paper, by applying the precoding technique in conjunction with the syndrome compression approach, we construct systematic $t$ -deletion $s$ -substitution correcting codes, where $t$ and $s$ are fixed positive integers. The redundancy of our c
Publikováno v:
2020 IEEE International Conference on Consumer Electronics - Asia (ICCE-Asia).
Constrained codes serve as an essential component of the recently emerged DNA-based data storage systems, where the associated complicated bio-chemical processes are difficult to model. In this paper, we propose a novel neural network (NN)- based dec
Publikováno v:
IEEE Communications Letters. 22:2004-2007
We propose a coding method to transform binary sequences into DNA base sequences (codewords), namely sequences of the symbols A , T , C , and G , that satisfy the following two properties: 1) run-length constraint: the maximum run-length of each symb
Publikováno v:
IEEE Transactions on Information Theory. 64:3513-3527
We consider the locally repairable codes (LRCs), aiming at sequentially recovering multiple erasures; in particular, we propose and study the so-called $(n, k, r, t)$ -sequential LRCs (SLRC) as an $[n,k]$ linear code, where any $t'~(\leq t)$ erasures