Zobrazeno 1 - 10
of 87
pro vyhledávání: '"Hu, Sihuang"'
We address the multi-node failure repair challenges for MDS array codes. Presently, two primary models are employed for multi-node repairs: the centralized model where all failed nodes are restored in a singular data center, and the cooperative model
Externí odkaz:
http://arxiv.org/abs/2405.02923
Publikováno v:
Des. Codes Cryptogr. (2024)
Locally repairable codes (LRCs) have attracted a lot of attention due to their applications in distributed storage systems. In this paper, we provide new constructions of optimal $(2, \delta)$-LRCs over $\mathbb{F}_q$ with flexible parameters. Firstl
Externí odkaz:
http://arxiv.org/abs/2307.04323
The sub-packetization $\ell$ and the field size $q$ are of paramount importance in the MSR array code constructions. For optimal-access MSR codes, Balaji et al. proved that $\ell\geq s^{\left\lceil n/s \right\rceil}$, where $s = d-k+1$. Rawat et al.
Externí odkaz:
http://arxiv.org/abs/2303.10467
ABS polar codes were recently proposed to speed up polarization by swapping certain pairs of adjacent bits after each layer of polar transform. In this paper, we observe that applying the Arikan transform $(U_i, U_{i+1}) \mapsto (U_{i}+U_{i+1}, U_{i+
Externí odkaz:
http://arxiv.org/abs/2209.02461
Publikováno v:
IEEE Transactions on Information Theory (Volume: 69, Issue: 6, June 2023)
Wang et al. (IEEE Transactions on Information Theory, vol. 62, no. 8, 2016) proposed an explicit construction of an $(n=k+2,k)$ Minimum Storage Regenerating (MSR) code with $2$ parity nodes and subpacketization $2^{k/3}$. The number of helper nodes f
Externí odkaz:
http://arxiv.org/abs/2208.04159
Publikováno v:
IEEE Transactions on Communications ( Volume: 71, Issue: 7, July 2023)
We consider polar codes constructed from the $2\times 2$ kernel $\begin{bmatrix} 1 & 0 \\ \alpha & 1 \end{bmatrix}$ over a finite field $\mathbb{F}_{q}$, where $q=p^s$ is a power of a prime number $p$, and $\alpha$ satisfies that $\mathbb{F}_{p}(\alp
Externí odkaz:
http://arxiv.org/abs/2203.14184
Publikováno v:
IEEE Transactions on Information Theory ( Volume: 69, Issue: 4, April 2023)
The construction of polar codes with code length $n=2^m$ involves $m$ layers of polar transforms. In this paper, we observe that after each layer of polar transforms, one can swap certain pairs of adjacent bits to accelerate the polarization process.
Externí odkaz:
http://arxiv.org/abs/2202.04454
In the standard polar code construction, the message vector $(U_0,U_1,\dots,U_{n-1})$ is divided into information bits and frozen bits according to the reliability of each $U_i$ given $(U_0,U_1,\dots,U_{i-1})$ and all the channel outputs. While this
Externí odkaz:
http://arxiv.org/abs/2111.02851
Publikováno v:
IEEE Transactions on Information Theory ( Volume: 69, Issue: 1, January 2023)
The famous Barnes-Wall lattices can be obtained by applying Construction D to a chain of Reed-Muller codes. By applying Construction ${{D}}^{{(cyc)}}$ to a chain of extended cyclic codes sandwiched between Reed-Muller codes, Hu and Nebe (J. London Ma
Externí odkaz:
http://arxiv.org/abs/2105.13827
Autor:
Eisenbarth, Simon, Hu, Sihuang
A structure theorem of the group codes which are relative projective for the subgroup $\lbrace 1 \rbrace$ of $G$ is given. With this, we show that all such relative projective group codes in a fixed group algebra $RG$ are in bijection to the chains o
Externí odkaz:
http://arxiv.org/abs/2010.12429