18 papers · ranked by Valyu relevance
Angelos Gkekas, Nikos A. Mitsiou, Ioannis Souldatos, George K. Karagiannidis
—This work studies the problem of constructing capacity-achieving codes from an algorithmic perspective. Specifically, we prove that there exists a Turing machine which, given a discrete memoryless channel p Y | X , a target rate R less than the channel capacity Cpp Y | X q, and an error tolerance ϵ ą 0, outputs a…
Guanchen He, Vasilisa A Kovaleva, Carl Barton, Paul G Thomas + 3 more
In this section, we describe our recursive combination approach. We show that this approach can combine short DCP-CWGCs to construct $(m,r,n=\text{min}{(mr),(mr+1)})$ DCP-CWGCs for any positive integer r and $(m\geqr+1)$. We then pair the recursive combination approach with BBA, and show that we can construct…
Alain Couvreur, Rakhi Pratihar
In 2021, Augot, Couvreur, Lavauzelle and Neri introduced a new class of rank metric codes which can be regarded as rank metric counterparts of Reed–Muller codes. Given a finite Galois extension L{K, these codes are defined as some specific L–subspaces of the twisted group algebra LrGs. We investigate the decoding of…
Liu, Bowie, Wong, Dennis + 4 more
We present the first known pivot Gray code for spanning trees of complete graphs, listing all spanning trees such that consecutive trees differ by pivoting a single edge around a vertex. This pivot Gray code thus addresses an open problem posed by Knuth in The Art of Computer Programming, Volume 4 (Exercise 101…
Huazi Zhang, Xianbin Wang, Jiajie Tong, Jun Wang + 1 more
This paper introduces a novel framework for polar codes, designed for flexible Incremental Redundancy Hybrid Automatic Repeat Request (IR-HARQ). By generalizing the decoding order beyond the standard 1$\to$N sequence, we enable a capacity-aware scheduling strategy that prioritizes the decoding of reliable subblocks.…
Philipp Mohr, Jasper Brüggmann, Viet Hoang Le, Gerhard Bauch
Block Markov superposition transmission (BMST) codes provide a flexible framework for constructing codes with near-capacity performance and low-complexity sliding-window decoding. However, existing BMST variants show contrasting performance limitations: recursive BMST (rBMST) codes suffer from error propagation but…
Wenhao Liu, Zhengyi Jiang, Zhongyi Huang, Hanxu Hou
Fluorescent labeling is a cornerstone of DNA visualization and a key enabler of random access in DNA-based data storage. However, the stochastic nature of biochemical processes, including synthesis, hybridization, and optical readout, induces \emph{burst} synchronization errors within the resulting labeling sequences.…
Kees Schouhamer Immink, Jos H. Weber, Tuan Thanh Nguyen, Kui Cai + 2 more
The design of low-complexity and efficient constrained codes has been a major research item for many years. This paper reports on a versatile method named concatenated constrained codes for designing efficient fixed-length constrained codes with small complexity. A concatenated constrained code comprises two (or more)…
Kanat Abdukhalikov, Rasha M. Shat, Patrick Solé
Quasi-cyclic codes of index 3 over finite fields are studied. We give a classification of such codes. Their duals with respect to the Euclidean and Hermitian inner products are investigated. We give a characterization of self-orthogonal and dual-containing codes. A quasi-cyclic code of index 3 is generated by at most…
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…
Wannes Mores, Satyajeet Bhonsale, Stylianos Floros, Filip Logist + 1 more
Genome-scale metabolic network reconstructions contain extremely detailed and valuable information regarding cellular metabolism. For many applications such as finding genetic engineering targets and reduced kinetic model construction, metabolic network analysis techniques exist. Yield spaces based on the extreme rays…
Lihong Cao
The human brain encodes a virtually infinite repertoire of semantic concepts using a finite number of neurons, a feat that defies the capacity limits of classical attractor networks. While “Concept Cells” in the medial temporal lobe (MTL) exhibit extreme sparsity, the information-theoretic principles governing their…
Willie K. Harrison, Truman Welling, Andrew Swain, Morteza Shoushtari + 1 more
Physical-layer security can aid in establishing secure telecommunication networks including cellular, Internet of Things, and telemetry networks, among others. Channel sounding techniques and/or telemetry systems for reporting channel conditions, coupled with superior wiretap code design are necessary to implement such…
Ibrahim Nawaz, Parv Agarwal, Thomas Heinis
DNA storage is a developing field that uses DNA to archive digital data owing to its superior information density and stability. Although DNA storage has been performed on a significant scale, challenges arise from the synthesis and sequencing of data-encoded oligonucleotides. Synthesis of DNA introduces significant…
Ramy Khabbaz, Jérémy Mateos, Marc Antonini, Serge Kas Hanna
The biochemical processes underlying DNA data storage, including synthesis, amplification, and sequencing, are inherently noisy. Consequently, base-level insertion, deletion, and substitution (IDS) errors, as well as sequence-level dropouts, occur and pose major challenges for reliable data retrieval. Here we introduce…
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…
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…
Afroditi Talidou, Wilten Nicola
Many existing models of computation in recurrent neural networks assume dense, unconstrained initial connectivity, where any pair of neurons may be coupled to generate the rich dynamics needed for learning complex temporal patterns. Inspired by invertebrate circuits that often exhibit ring-like connectivity, we show…