Related papers: A Gated Hypernet Decoder for Polar Codes
A modified successive cancellation list (SCL) decoder is proposed for polar-coded probabilistic shaping. The decoder exploits the deterministic encoding rule for shaping bits to rule out candidate code words that the encoder would not…
In coding theory, an error-correcting code can be encoded either systematically or non-systematically. In a systematic encode, the input data is embedded in the encoded output. Conversely, in a non-systematic code, the output does not…
A lower bound on minimum distance of convolutional polar codes is provided. The bound is obtained from the minimum weight of generalized cosets of the codes generated by bottom rows of the polarizing matrix. Moreover, a construction of…
While long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels when decoded by a low complexity successive cancelation (SC) algorithm, the error performance of the SC algorithm is inferior for polar…
This paper proposes a bitwise over-parameterized neural network (ONN) decoder for polar-coded transmission and develops a tractable theoretical performance analysis framework. By modeling each synthesized message channel as an individual…
Product codes are widespread in optical communications, thanks to their high throughput and good error-correction performance. Systematic polar codes have been recently considered as component codes for product codes. In this paper, we…
Polar codes are capacity-achieving error-correcting codes with an explicit construction that can be decoded with low-complexity algorithms. In this work, we show how the state-of-the-art low-complexity decoding algorithm can be improved to…
Under successive cancellation (SC) decoding, polar codes are inferior to other codes of similar blocklength in terms of frame error rate. While more sophisticated decoding algorithms such as list- or stack-decoding partially mitigate this…
We explore the relationship between polar and RM codes and we describe a coding scheme which improves upon the performance of the standard polar code at practical block lengths. Our starting point is the experimental observation that RM…
The long-haul communication systems can offer ultra high-speed data transfer rates but suffer from burst errors. The high-rate and high-performance staircase codes provide an efficient way for long-haul transmission. The staircase coding…
Polar codes are the latest breakthrough in coding theory, as they are the first family of codes with explicit construction that provably achieve the symmetric capacity of discrete memoryless channels. Ar{\i}kan's polar encoder and…
It is shown how to combine ordered statistics decoding (OSD) with CRC-aided belief propagation list (CBPL) decoding of polar codes. Even when the reprocessing order of the OSD is as low as one, the new decoder is shown to significantly…
The performance of short polar codes under successive cancellation (SC) and SC list (SCL) decoding is analyzed for the case where the decoder messages are coarsely quantized. This setting is of particular interest for applications requiring…
Most existing works of polar codes focus on the analysis of block error probability. However, in many scenarios, bit error probability is also important for evaluating the performance of channel codes. In this paper, we establish a new…
We propose a new framework for constructing polar codes (i.e., selecting the frozen bit positions) for arbitrary channels, and tailored to a given decoding algorithm, rather than based on the (not necessarily optimal) assumption of…
Neural decoders were shown to outperform classical message passing techniques for short BCH codes. In this work, we extend these results to much larger families of algebraic block codes, by performing message passing with graph neural…
Polar codes under successive cancellation decoding proposed by Ar{\i}kan provably achieve the symmetric capacity of any given binary-input discrete memoryless channel. The successive cancellation list decoder for polar codes was described…
Designing a practical, low complexity, close to optimal, channel decoder for powerful algebraic codes with short to moderate block length is an open research problem. Recently it has been shown that a feed-forward neural network…
Polar-coded multiple-input multiple-output systems are investigated. An advanced receiver implementing joint list decoding of polar codes and QR- and MMSE-based detectors is proposed. The approximate and exact path metrics are derived for…
A polar-coded transmission (PCT) scheme with joint channel estimation and decoding is proposed for channels with unknown channel state information (CSI). The CSI is estimated via successive cancellation (SC) decoding and the constraints…