18 papers · ranked by Valyu relevance
Mohaimen Mohammed, Mesut Çevik, Stefano Savazzi
This paper presents a Deep Autoencoder-LDPC-OFDM (DAE-LDPC-OFDM) transceiver architecture that integrates a learned belief propagation (BP) decoder to achieve robust, energy-efficient, and adaptive wireless communication. Unlike conventional modular systems that treat encoding, modulation, and decoding as independent…
Zhu Hong-wei, Wu, Xuantai, Lv Jingjie + 3 more
Low density parity check (LDPC) codes, initially discovered by Gallager, exhibit excellent performance in iterative decoding, approaching the Shannon limit. MDS array codes, with favorable algebraic structures, are codes suitable for decoding large burst errors. The Blaum-Roth (BR) code, an MDS array code similar to…
Ying Chen, Jianrong Bao, Yanhai Shang, Chao Liu + 5 more
To obtain efficient channel codes with high power efficiency at moderate signal-to-noise ratios (SNRs), an efficient high-rate protograph quasi-cyclic (QC) low-density parity-check (LDPC) codes is optimally constructed. By an optimized protograph template, the code framework is firstly produced by the extensions of the…
Guohua Zhang, Xiangya Liu, Jianhua Zhang, Yi Fang
Quasi-cyclic (QC) LDPC codes with large girths play a crucial role in several research and application fields, including channel coding, compressed sensing and distributed storage systems. A major challenge in respect of the code construction is how to obtain such codes with the shortest possible length (or…
Wenbo Shi, Wenlong Xie, Jiashen Hu, Lishan Liu + 1 more
Future wireless networks require channel coding schemes that can provide high reliability, low latency, and strong adaptability under finite-blocklength and structurally heterogeneous transmission scenarios. Globally coupled low-density parity-check (GC-LDPC) codes are promising for such systems because their coupled…
V. R. Danilko, I. Yu. Mogilnykh, Ya. A. Tikhomolov
We propose several approaches for bounding the minim\-um distances of the family of quasi-cyclic LDPC codes in the 5G NR standard. In particular, we show that the high-rate [9984, 8448] and the low-rate [25344, 8448] BG1 5G LDPC codes have minimum distances in the ranges {8..14} and {22..57}, respectively. Also we…
Gennady Shutkov, Dmitry Artemasov, Alexey Frolov, Pavel Rybin + 1 more
We consider the design of low-density parity-check (LDPC) codes for a given iterative decoder. Despite tools such as direct simulation, density evolution (DE), and EXIT-chart analysis, selecting a parity-check matrix remains a difficult combinatorial optimization problem. Existing approaches often rely on…
Jonathan Mandelbaum, Paul Bezner, Holger Jäkel, Stephan ten Brink + 1 more
In the short block length regime, ensemble decoding schemes with their inherently parallel structure can improve error correction performance and reduce latency compared to stand-alone suboptimal decoders such as belief propagation (BP). In this work, we introduce affine subcode ensemble decoding (aSCED), which uses an…
Paolo Santini
—In this paper, we present an efficient algorithm to sample random sparse matrices to be used as check matrices for quantum Low-Density Parity-Check (LDPC) codes. To ease the treatment, we mainly describe our algorithm as a technique to sample a dual-containing binary LDPC code, hence, a sparse matrix H ∈ F r×n 2 such…
Yuhang Wang, Weihua Chen, Linjing Song, Zhiping Xu + 6 more
With the rapid growth of data volume in sensor networks, lossy source coding systems achieve high-efficiency data compression with low distortion under limited transmission bandwidth. However, conventional compression algorithms rely on a two-stage framework with high computational complexity and frequently struggle to…
Yuwei Ma, Yingke Lei, Changming Liu, Wei Wang + 6 more
Facing heterogeneous signals increasing in dynamic spectrum, cognitive radio urgently needs blind channel coding identification. This technology addresses the core challenge of unknown coding schemes in non-cooperative communications. Existing methods are typically restricted to specific coding types and suffer from…
Muhammed Yusuf Şener, Gerhard Kramer, Shlomo Shamai (Shitz), Ronald Böhnke + 2 more
Dirty paper coding (DPC) is applied to multi-input multi-output (MIMO) broadcast channels with additive Gaussian noise and one message per receiver. The method decomposes each receiver MIMO channel into parallel scalar channels and applies modulo operators, amplitude-shift keying (ASK), and probabilistic shaping. The…
Keita Ishizuka, Yuhi Kamio
We establish a connection between linear complementary dual (LCD) codes and caps in projective space. Using this framework and the structure theory of maximal caps, we derive nonexistence theorems for LCD codes with minimum distance at least $4$, providing computation-free proofs that were previously obtained only…
Authors not listed
This work provides a rigorous theoretical investigation of selective error correction strategies for variational quantum algorithms, with focus on understanding the interplay between error suppression, circuit trainability, and computational resource requirements. We develop a mathematical framework that characterizes…
Felipe Coelho Argolo
Conant-Ashby’s (‘good regulator’) theorem states that a simple regulator of a system must behave as an image of it. Notably, evolutionary features present in living beings often mirror natural processes, yielding symmetries between biological structures and the external environment. For instance, nervous cells can…
Ryota Miyachi, Norikazu Ichihashi
All living systems use an almost identical genetic code, the standard genetic code, in which 20 amino acids are assigned to 61 codons non-randomly. According to the error minimization theory, amino acids are arranged to minimize the mutational effect on protein function, while experimental verification remains limited.…
Huanqiu Zhang, Israel Nelken, Tatyana Sharpee
Deciphering the neural code requires identifying its fundamental symbols or code-words. Neural activity is usually interpreted either as a rate code – based on average spike counts – or as a temporal code, which distinguishes patterns with identical counts. Yet, the symbols of the code remain undefined. Here we show…
Authors not listed
The Hidden Subgroup Problem (HSP) unifies several landmark quantum algorithms, yet systematic exploration of its variants and modern applications has slowed. This paper revives HSP-based algorithm design by examining new group structures with direct relevance to post-quantum cryptography, lattice problems, and…