Recursive descriptions of polar codes
From MaRDI portal
Publication:514520
DOI10.3934/amc.2017001zbMath1357.94084arXiv1209.4818MaRDI QIDQ514520
Publication date: 9 March 2017
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.4818
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Binary perfect codes of length 15 by the generalized concatenated construction
- List Decoding of Polar Codes
- Binary Polarization Kernels From Code Decompositions
- Soft-decision decoding of Reed-Muller codes: a simplified algorithm
- Soft-decision decoding of Reed-Muller codes: recursive lists
- Efficient Serial Message-Passing Schedules for LDPC Decoding
- Codes on graphs: normal realizations
- A Semi-Parallel Successive-Cancellation Decoder for Polar Codes
- An Efficient Partial-Sum Network Architecture for Semi-Parallel Polar Codes Decoder Implementation
- A Scalable Successive-Cancellation Decoder for Polar Codes
- Early Stopping Criteria for Energy-Efficient Low-Latency Belief-Propagation Polar Code Decoders
- LLR-Based Successive Cancellation List Decoding of Polar Codes
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- Polar Codes: Characterization of Exponent, Bounds, and Constructions