相关论文: A Practical Coding Scheme for the BSC with Feedbac…
Binary linear block codes (BLBCs) are essential to modern communication, but their diverse structures often require tailor-made decoders, increasing complexity. This work introduces enhanced polar decoding ($\mathsf{PD}^+$), a universal…
An alternative permutation decoding method is described which can be used for any binary systematic encoding scheme, regardless whether the code is linear or not. Thus, the method can be applied to some important codes such as Z2Z4-linear…
Resistive memories are considered a promising memory technology enabling high storage densities with in-memory computing capabilities. However, the readout reliability of resistive memories is impaired due to the inevitable existence of…
In this paper we consider a Metzner-Kapturowski-like decoding algorithm for high-order interleaved sum-rank-metric codes, offering a novel perspective on the decoding process through the concept of an error code. The error code, defined as…
We propose to reduce the decoding complexity of polar codes with non-Arikan kernels by employing a (near) ML decoding algorithm for the codes generated by kernel rows. A generalization of the order statistics algorithm is presented for soft…
String barcoding is a recently introduced technique for genomic-based identification of microorganisms. In this paper we describe the engineering of highly scalable algorithms for robust string barcoding. Our methods enable distinguisher…
Embedding approaches have become one of the most pervasive techniques for multi-label classification. However, the training process of embedding methods usually involves a complex quadratic or semidefinite programming problem, or the model…
This paper addresses the gradient coding and coded matrix multiplication problems in distributed optimization and coded computing. We present a numerically stable binary coding method which overcomes the drawbacks of the \textit{Fractional…
Binary optimisation tasks are ubiquitous in areas ranging from logistics to cryptography. The exponential complexity of such problems means that the performance of traditional computational methods decreases rapidly with increasing problem…
Non-binary linear block codes (NB-LBCs) are an important class of error-correcting codes that are especially competent in correcting burst errors. They have broad applications in modern communications and storage systems. However, efficient…
We address an open problem posed by Chen-Cheng-Qi (IEEE Trans.\ Inf.\ Theory, 2025): can the decoding of binary sum-rank-metric codes $\SR(C_1,C_2)$ with $2\times2$ matrix blocks be reduced entirely to decoding the constituent…
A set of sufficient conditions to construct $\lambda$-real symbol Maximum Likelihood (ML) decodable STBCs have recently been provided by Karmakar et al. STBCs satisfying these sufficient conditions were named as Clifford Unitary Weight…
The article explores an encoding and structural information processing approach using sparse bit vectors and fixed-length linear vectors. The following are presented: a discrete method of speculative stochastic dimensionality reduction of…
We describe a method of encoding various types of link diagrams, including those with classical, flat, rigid, welded, and virtual crossings. We show that this method may be used to encode link diagrams, up to equivalence, in a notation…
We study multi-user multi-way relay networks where $N$ user nodes exchange their information through a single relay node. We use network coding in the relay to increase the throughput. Due to the limitation of complexity, we only consider…
It is shown how to endow a hierarchy of sets of binary patterns with the structure of an abstract,normed C*-algebra. In the course we also recover an intermediate connection with the words of a Dyck language and Tempereley-Lieb algebras for…
We consider the problem of multiple descriptions (MD) source coding and propose new coding strategies involving both unstructured and structured coding layers. Previously, the most general achievable rate-distortion (RD) region for the…
We study the real-time simulation of open quantum systems, where the system is modeled by a spin chain, with each spin associated with its own harmonic bath. Our method couples the inchworm method for the spin-boson model and the modular…
We construct parametrized isometric tensor network states -- referred to as skeletons -- that allow us to explore phases of abelian topological order and can be efficiently implemented on quantum processors. We obtain stable finite…
In this letter, we present a hybrid iterative decoder for non-binary low density parity check (LDPC) codes over binary erasure channel (BEC), based on which the recursion of the erasure probability is derived to design non-binary LDPC codes…