Related papers: Sets of Low Correlation Sequences from Cyclotomy
Approximate counting via correlation decay is the core algorithmic technique used in the sharp delineation of the computational phase transition that arises in the approximation of the partition function of anti-ferromagnetic two-spin…
Due to their efficient encoding and decoding algorithms cyclic codes, a subclass of linear codes, have applications in consumer electronics, data storage systems, and communication systems. In this paper, Dickson polynomials of the first…
We discuss the problem for detecting long-range correlations in sequences of values obtained by generators of pseudo-random numbers. The basic idea is that the H{\"o}lder exponent for a sufficiently long sequence of uncorrelated random…
Slepian-Wolf theorem is a well-known framework that targets almost lossless compression of (two) data streams with symbol-by-symbol correlation between the outputs of (two) distributed sources. However, this paper considers a different…
Long-range low-power wireless communications, such as LoRa, are used in many IoT and environmental monitoring applications. They typically increase the communication range to several kilometers, at the cost of reducing the bitrate to a few…
Pseudorandom number generators are required to generate pseudorandom numbers which have good statistical properties as well as unpredictability in cryptography. An m-sequence is a linear feedback shift register sequence with maximal period…
Cyclic codes are an interesting type of linear codes and have applications in communication and storage systems due to their efficient encoding and decoding algorithms. They have been studied for decades and a lot of progress has been made.…
Cyclic codes have wide applications in data storage systems and communication systems. Employing two-prime Whiteman generalized cyclotomic sequences of order 6, we construct several classes of cyclic codes over the finite field GF}(q) and…
Due to the ability to provide superior error-correction performance, the successive cancellation list (SCL) algorithm is widely regarded as one of the most promising decoding algorithms for polar codes with short-to-moderate code lengths.…
We consider data transmission across discrete memoryless channels (DMCs) using variable-length codes with feedback. We consider the family of such codes whose rates are $\rho_N$ below the channel capacity $C$, where $\rho_N$ is a positive…
Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we…
Cyclic codes are an important subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics. In this paper, two families of optimal ternary cyclic codes are presented. The first…
This paper is focused on the design of phase sequences with good (aperiodic) autocorrelation properties in terms of Peak Sidelobe Level (PSL) and Integrated Sidelobe Level (ISL). The problem is formulated as a bi-objective Pareto…
For some applications where the speed of decoding and the fault tolerance are important, like in video storing, one of the successful answers is Fix-Free Codes. These codes have been applied in some standards like H.263+ and MPEG-4. The…
The generalized binary sequences of order 2 have been used to construct good binary cyclic codes [4]. The linear complexity of these sequences has been computed in [2]. The autocorrelation values of such sequences have been determined in…
Binary cyclic codes having large dimensions and minimum distances close to the square-root bound are highly valuable in applications where high-rate transmission and robust error correction are both essential. They provide an optimal…
Spatially-coupled LDPC codes are known to have excellent asymptotic properties. Much less is known regarding their finite-length performance. We propose a scaling law to predict the error probability of finite-length spatially-coupled…
Iterative decoding was not originally introduced as the solution to an optimization problem rendering the analysis of its convergence very difficult. In this paper, we investigate the link between iterative decoding and classical…
The identification of binary sequences with large merit factor (small mean-squared aperiodic autocorrelation) is an old problem of complex analysis and combinatorial optimization, with practical importance in digital communications…
A deep-learning-aided successive-cancellation list (DL-SCL) decoding algorithm for polar codes is introduced with deep-learning-aided successive-cancellation (DL-SC) decoding being a specific case of it. The DL-SCL decoder works by allowing…