A Randomized Construction of Polar Subcodes
classification
💻 cs.IT
math.IT
keywords
codesconstructionobtainedpolarsubcodesaimscodewordsdecoding
read the original abstract
A method for construction of polar subcodes is presented, which aims on minimization of the number of low-weight codewords in the obtained codes, as well as on improved performance under list or sequential decoding. Simulation results are provided, which show that the obtained codes outperform LDPC and turbo codes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.