19 papers · ranked by Valyu relevance
Asit Kumar Pradhan, Andrew Thangaraj, Arunkumar Subramanian
—Density evolution for protograph Low-Density Parity-Check (LDPC) codes is considered, and it is shown tha t the message-error rate falls double-exponentially with iterations whenever the degree-2 subgraph of the protograph is cyclefree and noise level is below threshold. Conditions for stability of protograph density…
Asit Kumar Pradhan, Arunkumar Subramanian, Andrew Thangaraj
—For certain degree-distribution pairs with non-zero fraction of degree-two bit nodes, the bit-error threshold of the standard ensemble of Low Density Parity Check (LDPC) codes is known to be close to capacity. However, the degree-two bit nodes preclude the possibility of a block-error threshold. Interestingly, LDPC…
Kadir Gümüş, Laurent Schmalen
—Error correction plays a major role in the reconciliation of continuous variable quantum key distribution (CV-QKD) and greatly affects the performance of the system. CV-QKD requires error correction codes of extremely low rates and high reconciliation efficiencies. There are only very few code designs available in…
Peng-Wei Zhang, Francis C. M. Lau, Chiu‐Wing Sham
In this paper, we propose a new method to design low-density parity-check Hadamard (LDPC-Hadamard) codes — a type of ultimate-Shannon-limit approaching channel codes. The technique is based on applying Hadamard constraints to the check nodes in a generalized protograph-based LDPC code, followed by lifting the…
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…
Dan Song, Meiyuan Miao, Lin Wang, T. Aaron Gulliver
Recently, a mesh model-based merging (M $3$) method and four basic graph models were proposed to construct the double protograph low-density parity-check (P-LDPC) code pair of the joint source channel coding (JSCC). Designing the protograph (mother code) of the P-LDPC code with both a good waterfall region and lower…
Andrew D. Cummins, David G. M. Mitchell, Erik Perrins, Jun Chen
Low-density parity-check (LDPC) codes form part of the IRIG-106 standard and have been successfully deployed for the Telemetry Group version of shaped-offset quadrature phase shift keying (SOQPSK-TG) modulation. Recently, LDPC code solutions have been proposed and optimized for continuous phase modulations (CPMs)…
Yang Liu, Sha Sun, Yuzhi Zhang, Bin Wang + 1 more
Spatially coupled low density parity check (SC-LDPC) are prominent candidates for future communication standards due to their “threshold saturation” properties. To evaluate the finite-length performance of SC-LDPC codes, a general and efficient finite-length analysis from the perspective of the base matrix is proposed.…
David G. M. Mitchell, Roxana Smarandache, Daniel J. Costello
—Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great interest to code designers because analysis and implementation are facilitated by the protograph structure and the use of circulant permutation matrices for protograph lifting. However, these restrictions impose undesirable fixed…
Sudarsan V. S. Ranganathan, D. Divsalar, Richard D. Wesel
—We consider the problem of constructing (3, L) quasi-cyclic low-density parity-check (LDPC) codes from complete protographs. A complete protograph is a small bipartite graph with two disjoint vertex sets such that every vertex in the variable-node set is connected to every vertex in the checknode set by a unique edge.…
Qiwang Chen, Zhiping Xu, Huihui Wu, Guofa Cai + 2 more
'Sadaf Salehkalaibar'] A key component of the joint source-channel coding (JSCC) scheme based on double low-density parity-check (D-LDPC) codes is the introduction of a linking matrix between the source LDPC code and channel LDPC code, by which the decoding information including the source redundancy and channel state…
Jaewha Kim, Jae-Won Kim, Jong‐Seon No
In this paper, we propose a new code design technique, called partial doping, for protograph-based generalized low-density parity-check (GLDPC) codes. While the conventional construction method of protograph-based GLDPC codes is to replace some single parity-check (SPC) nodes with generalized constraint (GC) nodes…
Elizabeth Tapia, Flavio Spetale, Flavia Krsticevic, Laura Angelone + 2 more
'Pilar Bulacio' 'Lars Kaderali'] For many parallel applications of Next-Generation Sequencing (NGS) technologies short barcodes able to accurately multiplex a large number of samples are demanded. To address these competitive requirements, the use of error-correcting codes is advised. Current barcoding systems are…
Shubham Chandak, Kedar Tatwawadi, Billy Lau, Jay Mardia + 6 more
With the amount of data being stored increasing rapidly, there is significant interest in exploring alternative storage technologies. In this context, DNA-based storage systems can offer significantly higher storage densities (petabytes/gram) and durability (thousands of years) than current technologies. Specifically…
Ian Holmes
We describe a strategy for constructing codes for DNA-based information storage by serial composition of weighted finite-state transducers. The resulting state machines can integrate correction of substitution errors; synchronization by interleaving watermark and periodic marker signals; conversion from binary to…
Zihui Yan, Guanjin Qu, Xin Chen, Gang Zheng + 1 more
DNA-based data storage is a promising solution to the challenges of large-scale data storage. However, the low throughput of the mainstream inkjet-based DNA synthesis method has hindered its widespread adoption. In contrast, high-throughput electrochemical synthesis provides higher throughput but with more nucleotide…
Zachary J. Gale-Day, Laura Shub, Kangway V. Chuang, Michael J. Keiser
Message-passing neural networks (MPNNs) on molecular graphs generate continuous and differentiable encodings of small molecules with state-of-the-art performance on protein-ligand complex scoring tasks. Here, we describe the Protein-Graph Network (PGN) package, an open-source toolkit that constructs ligand-receptor…
Authors not listed
Deciphering the correct mechanism governing certain phenomenon in polyelectrolyte (PE) brush grafted systems, revealed through atomistic simulations, is an extremely challenging problem. In a recent study, our all-atom molecular dynamics (MD) simulations revealed a non-linearly large electroosmotic flow (in the…
Inbal Preuss, Ben Galili, Zohar Yakhini, Leon Anavy
This study introduces a novel model for analyzing and determining the required sequencing coverage in DNA-based data storage, focusing on combinatorial DNA encoding. We explore the application of the coupon collector model for combinatorial-letter reconstruction, post-sequencing, which ensure efficient data retrieval…