Related papers: Polar Coding for Processes with Memory
$2^m$-ary modulation creates $m$ bit channels which are neither independent nor identical, and this causes problems when applying polar coding because polar codes are designed for independent identical channels. Different from the existing…
The experimental implementation of the polarization encoding system is presented using weak coherent pulses at a low enough frequency. The optical pulses are generated through intensity modulation at the repetition rate of $10$ pulses/sec…
Polar codes have emerged as the most favorable channel codes for their unique capacity-achieving property. To date, numerous works have been reported for efficient design of polar codes decoder. However, these prior efforts focused on…
A new score function is proposed for stack decoding of polar codes, which enables one to accurately compare paths of different lengths. The proposed score function includes bias, which reflects the average behaviour of the correct path.…
Large language models (LLMs) require significant memory to store Key-Value (KV) embeddings in their KV cache, especially when handling long-range contexts. Quantization of these KV embeddings is a common technique to reduce memory…
We propose a new Write-Once-Memory (WOM) coding scheme based on source polarization. By applying a source polarization transformation on the to-be-determined codeword, the proposed WOM coding scheme encodes information into the bits in the…
We present a novel analysis method for measurements of polarization transferred in $A(\vec{e},e'\vec{N})$ experiments, which can be applied to other kinds of polarization measurements as well. In this method the polarization transfer…
Polar coding was conceived originally as a technique for boosting the cutoff rate of sequential decoding, along the lines of earlier schemes of Pinsker and Massey. The key idea in boosting the cutoff rate is to take a vector channel (either…
In this paper, we study the connection between polar codes and product codes. Our analysis shows that the product of two polar codes is again a polar code, and we provide guidelines to compute its frozen set on the basis of the frozen sets…
Arikan's exciting discovery of polar codes has provided an altogether new way to efficiently achieve Shannon capacity. Given a (constant-sized) invertible matrix $M$, a family of polar codes can be associated with this matrix and its…
An open problem in polarization theory is to determine the binary operations that always lead to polarization (in the general multilevel sense) when they are used in Ar{\i}kan style constructions. This paper, which is presented in two…
In this paper, we introduce a new coding and decoding structure for enhancing the reliability and performance of polar codes, specifically at low error rates. We achieve this by concatenating two polar codes in series to create robust…
When a neural network (NN) is used to decode a polar code, its training complexity scales exponentially as the code block size (or to be precise, as a number of message bits) increases. Therefore, existing solutions that use a neural…
A cell is polarised when it has developed a main axis of organisation through the reorganisation of its cytosqueleton and its intracellular organelles. Polarisation can occur spontaneously or be triggered by external signals, like gradients…
Polar coding, introduced 2008 by Arikan, is the first (very) efficiently encodable and decodable coding scheme whose information transmission rate provably achieves the Shannon bound for classical discrete memoryless channels in the…
We demonstrate theoretically the spontaneous formation of a stochastic polarization in exciton-polariton Bose-Einstein condensates in planar microcavities under pulsed excitation. Below the threshold pumping intensity (dependent on the…
In this paper, we leverage polar codes and the well-established channel polarization to design capacity-achieving codes with a certain constraint on the weights of all the columns in the generator matrix (GM) while having a low-complexity…
This paper investigates the scaling exponent of polar codes for binary-input energy-harvesting (EH) channels with infinite-capacity batteries. The EH process is characterized by a sequence of i.i.d. random variables with finite variances.…
A rateless coding scheme transmits incrementally more and more coded bits over an unknown channel until all the information bits are decoded reliably by the receiver. We propose a new rateless coding scheme based on polar codes, and we show…
Polar codes are a class of capacity-achieving codes for the binary-input discrete memoryless channels (B-DMCs). However, when applied in channels with intersymbol interference (ISI), the codes may perform poorly with BCJR equalization and…