research
∙
07/10/2023
Optimal (2,δ) Locally Repairable Codes via Punctured Simplex Codes
Locally repairable codes (LRCs) have attracted a lot of attention due to...
share
research
∙
03/18/2023
MSR codes with linear field size and smallest sub-packetization for any number of helper nodes
The sub-packetization ℓ and the field size q are of paramount importance...
research
∙
09/06/2022
ABS+ Polar Codes: Exploiting More Linear Transforms on Adjacent Bits
ABS polar codes were recently proposed to speed up polarization by swapp...
research
∙
08/08/2022
Constructing MSR codes with subpacketization 2^n/3 for k+1 helper nodes
Wang et al. (IEEE Transactions on Information Theory, vol. 62, no. 8, 20...
research
∙
03/27/2022
All the codeword bits in polar codes have the same BER under the SC decoder
We prove that for any binary-input memoryless symmetric (BMS) channel, a...
research
∙
02/09/2022
Adjacent-Bits-Swapped Polar codes: A new code construction to speed up polarization
The construction of polar codes with code length n=2^m involves m layers...
research
∙
11/04/2021
A Dynamic Programming Method to Construct Polar Codes with Improved Performance
In the standard polar code construction, the message vector (U_0,U_1,…,U...
research
∙
05/28/2021
Extended Cyclic Codes Sandwiched Between Reed-Muller Codes
The famous Barnes-Wall lattices can be obtained by applying Construction...
research
∙
10/23/2020
Relative projective group codes over chain rings
A structure theorem of the group codes which are relative projective for...
research
∙
04/16/2018
