A Randomized Construction of Polar Subcodes

April 29, 2017 Β· Declared Dead Β· πŸ› International Symposium on Information Theory

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Peter Trifonov, Grigorii Trofimiuk arXiv ID 1705.00202 Category cs.IT: Information Theory Citations 58 Venue International Symposium on Information Theory Last Checked 5 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted