Pith

open record

sign in

arxiv: 2501.02917 · v5 · pith:WT6IGYOG · submitted 2025-01-06 · cs.IT · math.IT

On Achievable Rates Over Noisy Nanopore Channels

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:WT6IGYOGrecord.jsonopen to challenge →

classification cs.IT math.IT
keywords channelnanoporecapacitynoisenoisyrateschannelsconsider
0
0 comments X
read the original abstract

In this paper, we consider a recent channel model of a nanopore sequencer proposed by McBain, Viterbo, and Saunderson (2024), termed the noisy nanopore channel (NNC). In essence, an NNC is a duplication channel with structured, Markov inputs, that is corrupted by memoryless noise. We first discuss a (tight) lower bound on the capacity of the NNC in the absence of random noise. Next, we present lower and upper bounds on the channel capacity of general noisy nanopore channels. We then consider two interesting regimes of operation of an NNC: first, where the memory of the input process is large and the random noise introduces erasures, and second, where the rate of measurements of the electric current (also called the sampling rate) is high. For these regimes, we show that it is possible to achieve information rates close to the noise-free capacity, using low-complexity encoding and decoding schemes. In particular, our decoder for the regime of high sampling rates makes use of a change-point detection procedure -- a subroutine of immediate relevance for practitioners.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Concatenated Codes for Short-Molecule DNA Storage with Sequencing Channels of Positive Zero-Undetected-Error Capacity

    cs.IT 2026-02 unverdicted novelty 5.0

    The paper analyzes a concatenated coding scheme for short-molecule DNA storage over symmetric sequencing channels, deriving an achievability bound on reliable information scaling and proving exponential error decay fo...