Locally repairable codes (LRCs) have attracted a lot of attention due to...
The sub-packetization ℓ and the field size q are of paramount
importance...
ABS polar codes were recently proposed to speed up polarization by swapp...
Wang et al. (IEEE Transactions on Information Theory, vol. 62, no. 8, 20...
We prove that for any binary-input memoryless symmetric (BMS) channel, a...
The construction of polar codes with code length n=2^m involves m layers...
In the standard polar code construction, the message vector
(U_0,U_1,…,U...
The famous Barnes-Wall lattices can be obtained by applying Construction...
A structure theorem of the group codes which are relative projective for...
We prove an upper bound on the Shannon capacity of a graph via a linear
...