- Article
We design a decoding algorithm for linear codes over finite chain rings given by their parity check matrices. It is assumed that decoding algorithms over the residue field are known at each degree of the adic decomposition.
We design a decoding algorithm for linear codes over finite chain rings given by their parity check matrices. It is assumed that decoding algorithms over the residue field are known at each degree of the adic decomposition.
The conventional soft decision decoding (SDD) methods require various hard decision decoders (HDDs) based on different codes or re-manipulate the generator matrix by the complicated Gaussian elimination technique according to the bit reliability. Thi...
Wind energy is a clean energy source that is characterised by significant uncertainty. The electricity generated from wind power also exhibits strong unpredictability, which when integrated can have a substantial impact on the security of the power g...
Practically good error-correcting codes should have good parameters and efficient decoding algorithms. Some algebraically defined good codes, such as cyclic codes, Reed–Solomon codes, and Reed–Muller codes, have nice decoding algorithms....
Many families of binary nonlinear codes (e.g., Kerdock, Goethals, Delsarte–Goethals, Preparata) can be very simply constructed from linear codes over the
This paper attempts to highlight the decoding capabilities of MDP convolutional codes over the erasure channel by defining them as discrete linear dynamical systems, with which the controllability property and the observability characteristics of lin...
The parallel nature of the belief propagation (BP) decoding algorithm for polar codes opens up a real possibility of high throughput and low decoding latency during hardware implementation. To address the problem that the BP decoding algorithm introd...
In this paper, we propose a novel deep learning-based framework for the joint design and decoding of linear block codes, the end-to-end deep coding cross-attention message-passing Transformer (E2E DC-CrossMPT). To improve linear block code design and...
Recent works have combined random linear network coding (RLNC) with guessing random additive noise decoding (GRAND) to leverage RLNC packets to partially correct bit errors prior to RLNC decoding, so as to reduce the packet erasure rates in wireless...
Four-edge type low-density parity-check (FET-LDPC) codes, as an important subclass of multi-edge type LDPC codes, offer greater design flexibility and performance potential due to their heterogeneous edge type structure. However, their multi-dimensio...
Recently, motor imagery brain–computer interfaces (BCIs) have been developed for use in motor function assistance and rehabilitation engineering. In particular, lower-limb motor imagery BCI systems are receiving increasing attention in the fiel...
High-precision implantable multi-channel neural recording systems are considered as having a crucial role in the diagnosis and treatment of neurological disorders. However, it is a significant design challenge to achieve an optimal trade-off among li...
Accurate glomerular segmentation in renal pathological images is a key challenge for chronic kidney disease diagnosis and assessment. Due to the high visual similarity between pathological glomeruli and surrounding tissues in color, texture, and morp...
Auditory attention detection (AAD) is the tracking of a sound source to which a listener is attending based on neural signals. Despite expectation for the applicability of AAD in real-life, most AAD research has been conducted on recorded electroence...
The technological breakthrough in the form of Internet of Things (IoT), Big data and connected world is increasing the demand of better spectrum utilization. Half-Duplex (HD) transmission is mostly used in the earlier communication systems. The high...
Error-correcting codes form an important topic in information theory. They are used to correct errors that occur during transmission on a noisy channel. An important method for correcting errors is bounded distance decoding. The public-key cryptosyst...
Quaternion orthogonal designs (QODs) have been used to design STBCs that provide improved performance in terms of various design parameters. In this paper, we show that all QODs obtained from generic iterative construction techniques based on the Ada...
In this work, we propose a robust deep encoder–decoder neural network that integrates multiple deep sequence models for time series forecasting in sensor-based applications. The proposed approach features a sophisticated input embedding layer t...
In general, the problem of building optimal convolutional codes under a certain criteria is hard, especially when size field restrictions are applied. In this paper, we confront the challenge of constructing an optimal 2D convolutional code when comm...
In recent years, neural network based image priors have been shown to be highly effective for linear inverse problems, often significantly outperforming conventional methods that are based on sparsity and related notions. While pre-trained generative...
Capacity bounds for a three-node binary symmetric relay channel with orthogonal components at the destination are studied. The cut-set upper bound and the rates achievable using decode-and-forward (DF), partial DF and compress-and-forward (CF) relayi...
The use of quaternion orthogonal designs (QODs) to describe point-to-point communication among dual-polarized antennas has the potential to provide higher rate orthogonal and quasi-orthogonal complex designs exploiting polarization diversity among sp...
With the flourishing development of wireless communication, further challenges will be introduced by the future demands of emerging applications. However, in the face of more complex communication scenarios, favorable decoding results may not be yiel...
In this paper, we design and develop a new class of linear algebraic codes defined as soft linear algebraic codes using soft sets. The advantage of using these codes is that they have the ability to transmit m-distinct messages to m-set of receivers...
The Alternating Direction Method of Multipliers (ADMM) has proven to be an efficient approach for implementing linear programming (LP) decoding of low-density parity-check (LDPC) codes. By introducing penalty terms into the LP decoding model’s...
Relaying with network coding forms a basis for a variety of collaborative communication systems. A linear block coding framework for multi-way relaying using network codes introduced in the literature shows great promise for understanding, analyzing,...
In hybrid block-based video coding, transform plays an important role in energy compaction. Transform coding converts residual data in the spatial domain into frequency domain data, thereby concentrating energy in a lower frequency band. In VVC (vers...
Designing an efficient decoder is an effective way to improve the performance of polar codes with limited code length. List flip decoders have received attention due to their good performance trade-off between list decoders and flip decoders. In part...
The linear ubiquitin chain assembly complex (LUBAC) is a ubiquitin ligase composed of the Heme-oxidized IRP2 ubiquitin ligase-1L (HOIL-1L), HOIL-1L-interacting protein (HOIP), and Shank-associated RH domain interactor (SHARPIN) subunits. LUBAC specif...
This paper presents a joint source–channel image transmission model based on a modified trellis construction using variable-length and fixed-length codes. The model employs linear block trellis codes and a modified Bahl–Cocke–Jeline...
Financial time-series prediction has been an important topic in deep learning, and the prediction of financial time series is of great importance to investors, commercial banks and regulators. This paper proposes a model based on multiplexed attentio...
Weighted belief propagation (WBP) for the decoding of linear block codes is considered. In WBP, the Tanner graph of the code is unrolled with respect to the iterations of the belief propagation decoder. Then, weights are assigned to the edges of the...
This paper deals with the specific construction of binary low-density parity-check (LDPC) codes. We derive lower bounds on the error exponents for these codes transmitted over the memoryless binary symmetric channel (BSC) for both the well-known maxi...
We propose a reinforcement learning (RL)-based decoding framework for high-throughput parallel decoding of low-density parity-check (LDPC) codes using clustered scheduling. Parallel LDPC decoders must balance error-correction performance and decoding...
Multivariate pattern analysis (MVPA) has played an extensive role in interpreting brain activity, which has been applied in studies with modalities such as functional Magnetic Resonance Imaging (fMRI), Magnetoencephalography (MEG) and Electroencephal...
We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known codin...
This paper studies the hybrid flow shop scheduling problem with blocking constraints (BHFSP). To better understand the BHFSP, we will construct its mixed integer linear programming (MILP) model and use the Gurobi solver to demonstrate its correctness...
High-speed reconciliation is indispensable for supporting the continuous-variable quantum key distribution (CV-QKD) system to generate the secure key in real-time. However, the error correction process’s high complexity and low processing speed...
Brain neural activity decoding is an important branch of neuroscience research and a key technology for the brain–computer interface (BCI). Researchers initially developed simple linear models and machine learning algorithms to classify and rec...
This paper presents a lossless image compression method with a fast decoding time and flexible adjustment of coder parameters affecting its implementation complexity. A comparison of several approaches for computing non-MMSE prediction coefficients w...
In this paper, we study the outage and throughput performance for the simultaneous wireless information and power transfer (SWIPT) cooperative decode-and-forward (DF) communication systems. The hybrid receiver that uses both time switching (TS) and p...
Automatic image caption prediction is a challenging task in natural language processing. Most of the researchers have used the convolutional neural network as an encoder and decoder. However, an accurate image caption prediction requires a model to u...
In complex network environments, there always exist heterogeneous devices with different computational powers. In this work, we propose a novel scalable random linear network coding (RLNC) framework based on embedded fields, so as to endow heterogene...
Wireless Sensor Networks (WSNs), where a multiplicity of sensors observe a physical phenomenon and transmit their measurements to one or more sinks, pertain to the class of multi-terminal source and channel coding problems of Information Theory. In t...
The introduction of an attention mechanism in remote sensing image segmentation improves the accuracy of the segmentation. In this paper, a novel multi-scale KAN-based linear attention (MKLA) segmentation network of MKLANet is developed to promote a...
The early and accurate diagnosis of skin cancer is crucial for providing patients with advanced treatment by focusing medical personnel on specific parts of the skin. Networks based on encoder–decoder architectures have been effectively impleme...
Quantum error correction (QEC) is crucial for achieving reliable quantum computation. Among topological QEC codes, color codes can correct bit-flip and phase-flip errors simultaneously, enabling efficient resource utilization. However, existing decod...
Brain–machine interfaces (BMIs) aim to decode motor intentions from neural activity to enable direct control of external devices. However, most existing decoders rely on monolithic architectures that fail to capture the distinct neural represen...
Hyperspectral Unmixing is the process of decomposing a mixed pixel into its pure materials (endmembers) and estimating their corresponding proportions (abundances). Although linear unmixing models are more common due to their simplicity and flexibili...
Decoding of random linear block codes has been long exploited as a computationally hard problem on which it is possible to build secure asymmetric cryptosystems. In particular, both correcting an error-affected codeword, and deriving the error vector...
of 9