Cover Image

On Achievable Rates Over Noisy Nanopore Channels

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Rameshwar, V. Arvind, Weinberger, Nir
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Information Rates Over Multi-View Channels
by: Rameshwar, V. Arvind, et al.
Published: (2024)

Achievable Rates and Error Probability Bounds of Frequency-based Channels of Unlimited Input Resolution
by: Tamir, Ran, et al.
Published: (2025)

An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC
by: Rameshwar, V. Arvind, et al.
Published: (2024)

On the Capacity of Noisy Frequency-based Channels
by: Gerzon, Yuval, et al.
Published: (2026)

Achievable Rates of Nanopore-based DNA Storage
by: McBain, Brendon, et al.
Published: (2025)

On the Error Probability of RPA Decoding of Reed-Muller Codes over BMS Channels
by: Fathollahi, Dorsa, et al.
Published: (2026)

Bounding User Contributions for User-Level Differentially Private Mean Estimation
by: Rameshwar, V. Arvind, et al.
Published: (2025)

$(\ell,δ)$-Diversity: Linkage-Robustness via a Composition Theorem
by: Rameshwar, V. Arvind, et al.
Published: (2025)

On Achievable Rates for the Shotgun Sequencing Channel with Erasures
by: Narayanan, Hrishi, et al.
Published: (2024)

Multi-Terminal Remote Generation and Estimation Over a Broadcast Channel With Correlated Priors
by: Egger, Maximilian, et al.
Published: (2025)

On Improving the Composition Privacy Loss in Differential Privacy for Fixed Estimation Error
by: Rameshwar, V. Arvind, et al.
Published: (2024)

Optimal Overlap Detection of Shotgun Reads
by: Luria, Nir, et al.
Published: (2025)

Capacity of Frequency-based Channels: Encoding Information in Molecular Concentrations
by: Gerzon, Yuval, et al.
Published: (2024)

ORBGRAND: Achievable Rate for General Bit Channels and Application in BICM
by: Li, Zhuang, et al.
Published: (2024)

Optimal Tree-Based Mechanisms for Differentially Private Approximate CDFs
by: Rameshwar, V. Arvind, et al.
Published: (2024)

Estimating the Weight Enumerators of Reed-Muller Codes via Sampling
by: Jain, Shreyas, et al.
Published: (2024)

Achievable Rates and Error Exponents for a Class of Mismatched Compound Channels
by: Patel, Priyanka, et al.
Published: (2025)

How to Increase the Achievable Information Rate by Per-Channel Dispersion Compensation
by: Keykhosravi, Kamran, et al.
Published: (2018)

Identification Over Noisy Permutation Channels
by: Sarkar, Abhishek, et al.
Published: (2024)

An Achievable Rate-Distortion Region of Joint Identification and Sensing for Multiple Access Channels
by: Zhao, Yaning, et al.
Published: (2024)

Achievable Rate and Coding Principle for MIMO Multicarrier Systems With Cross-Domain MAMP Receiver Over Doubly Selective Channels
by: Chi, Yuhao, et al.
Published: (2026)

DeepDIVE: Optimizing Input-Constrained Distributions for Composite DNA Storage via Multinomial Channel
by: Kobovich, Adir, et al.
Published: (2025)

Achievable Rates for a Distributed Antenna System with No Channel State Information at the Central Processor
by: Song, Yi, et al.
Published: (2025)

A Toolbox for Refined Information-Theoretic Analyses with Applications
by: Merhav, Neri, et al.
Published: (2024)

Concatenated Codes for Short-Molecule DNA Storage with Sequencing Channels of Positive Zero-Undetected-Error Capacity
by: Tamir, Ran, et al.
Published: (2026)

M-DAB: An Input-Distribution Optimization Algorithm for Composite DNA Storage by the Multinomial Channel
by: Kobovich, Adir, et al.
Published: (2023)

Characterization of the Distortion-Perception Tradeoff for Finite Channels with Arbitrary Metrics
by: Freirich, Dror, et al.
Published: (2024)

Maximum Achievable Rate of Resistive Random-Access Memory Channels by Mutual Information Spectrum Analysis
by: Song, Guanghui, et al.
Published: (2024)

An Achievable Rate-Distortion Region for Joint State and Message Communication over Multiple Access Channels
by: Li, Xinyang, et al.
Published: (2024)

Achievable Rate Regions for Multi-terminal Quantum Channels via Coset Codes
by: Gouiaa, Fatma, et al.
Published: (2025)

An Achievable Rate Region for $3-$User Classical-Quantum Broadcast Channels
by: Gouiaa, Fatma, et al.
Published: (2022)

Capacity-Maximizing Input Symbol Selection for Discrete Memoryless Channels
by: Egger, Maximilian, et al.
Published: (2024)

Exploration-Exploitation Tradeoff in Universal Lossy Compression
by: Weinberger, Nir, et al.
Published: (2025)

A representation-learning game for classes of prediction tasks
by: Uzan, Neria, et al.
Published: (2024)

Maximal-Capacity Discrete Memoryless Channel Identification
by: Egger, Maximilian, et al.
Published: (2024)

An Achievable Scheme for the K-user Linear Computation Broadcast Channel
by: Ma, Yinbin, et al.
Published: (2025)

Achievability Bounds of Coding with Finite Blocklength for Gaussian Broadcast Channels
by: Ünsal, Ayşe, et al.
Published: (2026)

Simultaneous Decoding of Classical Coset Codes over $3-$User Quantum Broadcast Channel: New Achievable Rate Regions
by: Gouiaa, Fatma, et al.
Published: (2025)

Nonlinearity Mitigation in WDM Systems: Models, Strategies, and Achievable Rates
by: Secondini, Marco, et al.
Published: (2018)

Achievable Rates for Information Extraction from a Strategic Sender
by: Vora, Anuj S., et al.
Published: (2023)