Specifications of Error-Correcting Codes
This page contains specifications of error-correcting codes from the manuscripts
[1] Vera Miloslavskaya, Branka Vucetic “Design of Short Polar Codes for SCL Decoding”, IEEE Transactions on Communications, vol. 68, pp. 6657-6668, 2020.
[2] Vera Miloslavskaya, Branka Vucetic, Yonghui Li, Giyoon Park, Ok-Sun Park, "Recursive Design of Precoded Polar Codes for SCL Decoding", IEEE Transactions on Communications, vol. 69, no. 12, pp. 7945–7959, 2021.
[3] Vera Miloslavskaya, Yonghui Li, Branka Vucetic "Design of Compactly Specified Polar Codes with Dynamic Frozen Bits Based on Reinforcement Learning", IEEE Transactions on Communications, vol. 72, no. 3, pp. 1257–1272, 2024.
[4] Vera Miloslavskaya, Yonghui Li, Branka Vucetic "Frozen Set Design for Precoded Polar Codes", submitted to IEEE Transactions on Communications.
For each code, we provide a txt file containing three alternative code specifications:
The SC aimed precoding matrix Z,
The generator matrix Z·A⊗m,
The generator matrix Z·B·A⊗m=Z·A⊗m·B,
where A is the 2x2 kernel, ⊗m denotes the m-fold Kronecker product, and B is the bit reversal permutation matrix.
For polar codes with CRC, the txt files also contain CRC polynomials.
The notation (n,k) denotes a linear code of the length n and dimension k.
Proposed Short Precoded Polar Codes [1]
Proposed Recursively Precoded Polar Codes [2]
(128,21), (128,32), (128,42), (128,64), (128,84), Simulation Results
(256,43), (256,64), (256,85), (256,128), (256,171), Simulation Results
Polar codes with CRC6 [2]
Polar codes with CRC8 [2]
Number-polar codes based on reinforcement learning [3]
Proposed GenAlgTB frozen sets and precoded polar codes [4]
The frozen sets and generator matrices will appear if the manuscript gets accepted.