14 papers · ranked by Valyu relevance
Ilya Dumer
—Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length n and fixed order r. An algorithm is designed that has complexity of order n log n and corrects most error patterns of weight up to n(1 / 2 − ε ) given that ε exceeds n − 1 / 2 r . This improves the asymptotic bounds known for…
Ilya Dumer
Successive cancellation (SC) decoding was considered in [1] for general Reed-Muller codes RM(r, m) of order r and dimension m. It was also proposed in [1] to set to zeros those information bits that are the least protected in SC decoding. Simulation results of [1] show that the resulting subcodes with frozen bits…
Ilya Dumer
New soft- and hard decision decoding algorithms are presented for general Reed-Muller codes m r of length 2m and distance 2m−r . We use Plotkin (u, u + v) construction and decompose code m r onto subblocks u ∈ m−1 r and v ∈ n m−1 r−1 o . In decoding, we first try to find a subblock v from the better protected code and…
Ilya Dumer, Kirill Shabunov
In this paper, we consider decoding algorithms that can achieve good performance and low complexity on moderate blocklengths. Our goal is to fill the void left by the best algorithms, such as optimum maximum likelihood (ML) decoding, which has unfeasible complexity even on relatively short blocks, and iterative…
Nghia Doan, Seyyed Ali Hashemi, Warren J. Gross
—A novel permuted fast successive-cancellation list decoding algorithm with fast Hadamard transform (FHT-FSCL ) is presented. The proposed decoder initializes L ( L ≥ 1) active decoding paths with L random codeword permutations sampled from the full symmetry group of the codes. The path extension in the permutation…
Andrey Eliseyev, Tetiana Aksenova, Derek Abbott
In the article tensor-input/tensor-output blockwise Recursive N-way Partial Least Squares (RNPLS) regression is considered. It combines the multi-way tensors decomposition with a consecutive calculation scheme and allows blockwise treatment of tensor data arrays with huge dimensions, as well as the adaptive modeling of…
Liyan Xu, Fabing Duan, Xiao Gao, Derek Abbott + 1 more
Suprathreshold stochastic resonance (SSR) is a distinct form of stochastic resonance, which occurs in multilevel parallel threshold arrays with no requirements on signal strength. In the generic SSR model, an optimal weighted decoding scheme shows its superiority in minimizing the mean square error (MSE). In this…
Rithea Ngeth, Brian M. Kurkoski, Yuto Lim, Yasuo Tan
This paper investigates the design of overlapped chunked codes (OCC) for multi-source multi-relay networks where a physical-layer network coding approach, compute-and-forward (CF) based on nested lattice codes (NLC), is applied for the simultaneous transmissions from the sources to the relays. This code is called…
Sajjad Nassirpour, Ilan Shomorony, Alireza Vahid
We study the problem of retrieving data from a channel that breaks the input sequence into a set of unordered fragments of random lengths, which we refer to as the chop-and-shuffle channel. The length of each fragment follows a geometric distribution. We propose nested Varshamov-Tenengolts (VT) codes to recover the…
Kairui Tian, Rongke Liu, Zheng Lu, Xiaowei Wu + 3 more
'Jinhong Yuan' 'Min Qiu'] The newly developed automorphism ensemble decoder (AED) leverages the rich automorphisms of Reed-Muller (RM) codes to achieve near maximum likelihood (ML) performance at short code lengths. However, the performance gain of AED comes at the cost of high complexity, as the ensemble size required…
Hanwen Yao, Arman Fazeli, Alexander Vardy, Mahyar Shirvanimoghaddam
Polar coding gives rise to the first explicit family of codes that provably achieve capacity with efficient encoding and decoding for a wide range of channels. However, its performance at short blocklengths under standard successive cancellation decoding is far from optimal. A well-known way to improve the performance…
Janus Heide, Morten V. Pedersen, Frank H. P. Fitzek, Muriel Médard
—Random Linear Network Coding (RLNC) provides a theoretically efficient method for coding. Some of its practical drawbacks are the complexity of decoding and the overhead due to the coding vectors. For computationally weak and battery-driven platforms, these challenges are particular important. In this work, we…
David Kracht, Steffen Schober
Background Barcode multiplexing is a key strategy for sharing the rising capacity of next-generation sequencing devices: Synthetic DNA tags, called barcodes, are attached to natural DNA fragments within the library preparation procedure. Different libraries, can individually be labeled with barcodes for a joint…
Nithin Nagaraj, Arun Somani
Error detection is a fundamental need in most computer networks and communication systems in order to combat the effect of noise. Error detection techniques have also been incorporated with lossless data compression algorithms for transmission across communication networks. In this paper, we propose to incorporate a…