Related papers: An Efficient Construction Method Based on Partial …
We propose a serverless computing mechanism for distributed computation based on polar codes. Serverless computing is an emerging cloud based computation model that lets users run their functions on the cloud without provisioning or…
Polar codes are a class of {\bf structured} channel codes proposed by Ar{\i}kan based on the principle of {\bf channel polarization}, and can {\bf achieve} the symmetric capacity of any Binary-input Discrete Memoryless Channel (B-DMC). The…
A practical $2^m$-ary polar coded modulation (PCM) scheme with optimal constellation labeling is proposed. To efficiently find the optimal labeling rule, the search space is reduced by exploiting the symmetry properties of the channels.…
We consider finite-level, symmetric quantization procedures for construction and decoding of polar codes. Whether polarization occurs in the presence of quantization is not known in general. Hassani and Urbanke have shown that a simple…
In this paper, we investigate a coupled polar code architecture that supports both local and global decoding. This local-global construction is motivated by practical applications in data storage and transmission where reduced-latency…
In this paper, we establish the partial order (POs) for both the binary erasure channel (BEC) and the binary memoryless symmetric channel (BMSC) under any block rate-matched polar codes. Firstly, we define the POs in the sense of…
Noisy shuffling channels capture the main characteristics of DNA storage systems where distinct segments of data are received out of order, after being corrupted by substitution errors. For realistic schemes with short-length segments,…
In this paper, we shed light on how an adaptive, efficient error coding in the transport layer helps ensure the application requirements. We recap the use of MDS codes and show that binary coding can significantly reduce the complexity and…
In this paper we present a concrete algebraic construction of a novel class of convolutional codes. These codes are built upon generalized Vandermonde matrices and therefore can be seen as a natural extension of Reed-Solomon block codes to…
The Coronal Multichannel Polarimeter (CoMP) routinely performs coronal polarimetric measurements using the Fe XIII 10747 $\AA$ and 10798 $\AA$ lines, which are sensitive to the coronal magnetic field. However, inverting such polarimetric…
In this paper, we introduce stitched polar codes, a novel generalization of Ar{\i}kan's regular polar codes. Our core methodology reconfigures the fundamental polarization process by stitching additional structures to enhance the…
Coded computation techniques provide robustness against straggling workers in distributed computing. However, most of the existing schemes require exact provisioning of the straggling behaviour and ignore the computations carried out by…
In wireless communication systems, dual-polarized (DP) instead of single-polarized (SP) multiple-input multiple-output (MIMO) transmission is used to improve the spectral efficiency under certain conditions on the channel and the…
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…
Polar codes have been selected as the channel coding scheme for control channel in the fifth generation (5G) communication system thanks to their capacity achieving characteristics. However, the traditional polar codes support only codes…
Many applications using large datasets require efficient methods for minimizing a proximable convex function subject to satisfying a set of linear constraints within a specified tolerance. For this task, we present a proximal projection…
This paper presents the first proof of polarization for the deletion channel with a constant deletion rate and a regular hidden-Markov input distribution. A key part of this work involves representing the deletion channel using a trellis…
Practical constructions of lossless distributed source codes (for the Slepian-Wolf problem) have been the subject of much investigation in the past decade. In particular, near-capacity achieving code designs based on LDPC codes have been…
Deep learning-based reduced order models (DL-ROMs) have been recently proposed to overcome common limitations shared by conventional reduced order models (ROMs) - built, e.g., through proper orthogonal decomposition (POD) - when applied to…
In this letter, we propose a reliability-based windowed decoding scheme for spatially-coupled (SC) low-density parity-check (LDPC) codes. To mitigate the error propagation along the sliding windowed decoder of the SC LDPC codes, a partial…