Related papers: Strange Attractor for Efficient Polar Code Design
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…
Disorder and noise in physical systems often disrupt spatial and temporal regularity, yet chaotic systems reveal how order can emerge from unpredictable behavior. Complex networks, spatial analogs of chaos, exhibit disordered, non-Euclidean…
A capacity-achieving scheme based on polar codes is proposed for reliable communication over multi-channels which can be directly applied to bit-interleaved coded modulation schemes. We start by reviewing the ground-breaking work of polar…
In this paper, we design explicit codes for strong coordination in two-node networks. Specifically, we consider a two-node network in which the action imposed by nature is binary and uniform, and the action to coordinate is obtained via a…
Explicit coding schemes are proposed to achieve the rate-distortion function of the Heegard-Berger problem using polar codes. Specifically, a nested polar code construction is employed to achieve the rate-distortion function for the…
Polar codes are a recent family of error-correcting codes with a number of desirable characteristics. Their disruptive nature is illustrated by their rapid adoption in the $5^{th}$-generation mobile-communication standard, where they are…
Quaternary code (QC) designs form an attractive class of nonregular factorial fractions. We develop a complementary set theory for characterizing optimal QC designs that are highly fractionated in the sense of accommodating a large number…
Constrained codes are used to prevent errors from occurring in various data storage and data transmission systems. They can help in increasing the storage density of magnetic storage devices, in managing the lifetime of electronic storage…
This paper introduces almost partitionable sets to generalize the known concept of partitionable sets. These notions provide a unified frame to construct $\mathbb{Z}$-cyclic patterned starter whist tournaments and cyclic balanced sampling…
The recently-discovered polar codes are widely seen as a major breakthrough in coding theory. These codes achieve the capacity of many important channels under successive cancellation decoding. Motivated by the rapid progress in the theory…
Arikan's polar codes are capable of achieving the Shannon's capacity at a low encoding and decoding complexity, while inherently supporting rate adaptation. By virtue of these attractive features, polar codes have provided fierce…
The aim of this paper is to find an upper bound for the box-counting dimension of uniform attractors for non-autonomous dynamical systems. Contrary to the results in literature, we do not ask the symbol space to have finite box-counting…
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.…
A pruned variant of polar coding is reinvented for all binary erasure channels. For small $\varepsilon>0$, we construct codes with block length $\varepsilon^{-5}$, code rate $\text{Capacity}-\varepsilon$, error probability $\varepsilon$,…
This paper develops a method for obtaining guaranteed outer approximations for global attractors of continuous and discrete time nonlinear dynamical systems. The method is based on a hierarchy of semidefinite programming problems of…
Parametric modulation in nonlinear dynamical systems can give rise to attractors on which the dynamics is aperiodic and nonchaotic, namely with largest Lyapunov exponent being nonpositive. We describe a procedure for creating such…
Performance of reliable communication over a coherent slow fading channel at high SNR is succinctly captured as a fundamental tradeoff between diversity and multiplexing gains. We study the problem of designing codes that optimally tradeoff…
We propose a notion of a generalized order, which can be used for the notion of a strict partial order. We introduce a weak order to replace the usual weak order defined from a strict partial order. In a constructive setting, that usual…
Polar codes, introduced recently by Ar\i kan, are the first family of codes known to achieve capacity of symmetric channels using a low complexity successive cancellation decoder. Although these codes, combined with successive cancellation,…
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…