相关论文: Duality of Channel Encoding and Decoding - Part I:…

In this paper, we discuss two-stage encoding algorithms capable of correcting a fraction of asymmetric errors. Suppose that the encoder transmits $n$ binary symbols $(x_1,\ldots,x_n)$ one-by-one over the Z-channel, in which a 1 is received…

We propose a new class of efficient decoding algorithms for Reed-Muller (RM) codes over binary-input memoryless channels. The algorithms are based on projecting the code on its cosets, recursively decoding the projected codes (which are…

There are two gradient descent decoding procedures for binary codes proposed independently by Liebler and by Ashikhmin and Barg. Liebler in his paper mentions that both algorithms have the same philosophy but in fact they are rather…

We present a new fast Chase decoding algorithm for binary BCH codes. The new algorithm reduces the complexity in comparison to a recent fast Chase decoding algorithm for Reed--Solomon (RS) codes by the authors (IEEE Trans. IT, 2022), by…

We consider binary systematic network codes and investigate their capability of decoding a source message either in full or in part. We carry out a probability analysis, derive closed-form expressions for the decoding probability and show…

This paper studies channel coding for the discrete memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. A multi-letter successive decoding rule depending on an arbitrary non-negative decoding metric is…

This paper studies a two-layer decoding method that mitigates inter-cell interference in multi-cell Massive MIMO systems. In layer one, each base station (BS) estimates the channels to intra-cell users and uses the estimates for local…

High-rate concatenated quantum codes offer a promising pathway toward fault-tolerant quantum computation, yet designing efficient decoders that fully exploit their error-correction capability remains a significant challenge. In this work,…

A binary matrix is called an s-separable code for the disjunctive multiple-access channel (disj-MAC) if Boolean sums of sets of s columns are all distinct. The well-known issue of the combinatorial coding theory is to obtain upper and lower…

The maximum information rates for bandlimited channels with direct detection are achieved with joint detection and decoding (JDD), but JDD is often too complex to implement. Two receiver structures are studied to reduce complexity: separate…

This paper proposes a belief propagation (BP) message passing algorithm based joint multiple symbol differential detection (MSDD) and channel decoding scheme for noncoherent differential ultra-wideband impulse radio (UWB-IR) systems. MSDD…

An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be…

The design of modulation schemes for the physical layer network-coded two-way MIMO relaying scenario is considered, with $n_R$ antennas at the relay R, $n_A$ and $n_B$ antennas respectively at the end nodes A and B. We consider the…

In practical asynchronous bi-directional relaying, symbols transmitted by two sources cannot arrive at the relay with perfect frame and symbol alignments and the asynchronous multiple-access channel (MAC) should be seriously considered.…

This work is on fast encoding and decoding of polar codes. We propose and detail 8-bit and 16-bit parallel decoders that can be used to reduce the decoding latency of the successive-cancellation decoder. These decoders are universal and can…

We address photon-number-assisted, polarization- based, binary communication systems equipped with photon counting receivers. In these channels information is encoded in the value of polarization phase-shift but the carrier has and…

Rate and diversity impose a fundamental trade-off in communications. This trade-off was investigated for flat-fading channels in [15] as well as for Inter-symbol Interference (ISI) channels in [1]. A different point of view was explored in…

Many images and videos are primarily processed by computer vision algorithms, involving only occasional human inspection. When this content requires compression before processing, e.g., in distributed applications, coding methods must…

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.…

In source coding, either with or without side information at the decoder, the ultimate performance can be achieved by means of random binning. Structured binning into cosets of performing channel codes has been successfully employed in…