Cover Image

Block Length Gain for Nanopore Channels

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lin, Yu-Ting, Wang, Hsin-Po, Guruswami, Venkatesan
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

How Many Matrices Should I Prepare To Polarize Channels Optimally Fast?
by: Wang, Hsin-Po, et al.
Published: (2024)

Successive Cancellation Sampling Decoder: An Attempt to Analyze List Decoding Theoretically
by: Wang, Hsin-Po, et al.
Published: (2024)

Geno-Weaving: Low-Complexity Capacity-Achieving DNA Storage
by: Wang, Hsin-Po, et al.
Published: (2024)

Isolate and then Identify: Rethinking Adaptive Group Testing
by: Wang, Hsin-Po, et al.
Published: (2024)

Capacity-Achieving Gray Codes
by: Guruswami, Venkatesan, et al.
Published: (2024)

Nonadaptive Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding
by: Guruswami, Venkatesan, et al.
Published: (2023)

Quickly-Decodable Group Testing with Fewer Tests: Price-Scarlett and Cheraghchi-Nakos's Nonadaptive Splitting with Explicit Scalars
by: Wang, Hsin-Po, et al.
Published: (2024)

Maximal Recoverability: A Nexus of Coding Theory
by: Brakensiek, Joshua, et al.
Published: (2026)

Structure Theorems (and Fast Algorithms) for List Recovery of Subspace-Design Codes
by: Goyal, Rohan, et al.
Published: (2025)

Near-Asymptotically-Good Quantum Codes with Transversal CCZ Gates and Sublinear-Weight Parity-Checks
by: Golowich, Louis, et al.
Published: (2025)

Decoding Quasi-Cyclic Quantum LDPC Codes
by: Golowich, Louis, et al.
Published: (2024)

Quantum LDPC Codes of Almost Linear Distance via Homological Products
by: Golowich, Louis, et al.
Published: (2024)

Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates
by: Golowich, Louis, et al.
Published: (2024)

Explicit Constant-Alphabet Subspace Design Codes
by: Goyal, Rohan, et al.
Published: (2026)

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
by: Alrabiah, Omar, et al.
Published: (2024)

Punctured Low-Bias Codes Behave Like Random Linear Codes
by: Guruswami, Venkatesan, et al.
Published: (2021)

Sidorenko-Inspired Pessimistic Estimation
by: Lin, Yu-Ting, et al.
Published: (2026)

A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble
by: Guruswami, Venkatesan, et al.
Published: (2023)

Ambidextrous Degree Sequence Bounds for Pessimistic Cardinality Estimation
by: Lin, Yu-Ting, et al.
Published: (2025)

Tight bounds for stream decodable error-correcting codes
by: Gupta, Meghal, et al.
Published: (2024)

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
by: Alrabiah, Omar, et al.
Published: (2023)

Redundancy Is All You Need (for CSP Sparsification)
by: Brakensiek, Joshua, et al.
Published: (2024)

Semirandom Planted Clique via 1-norm Isometry Property
by: Guruswami, Venkatesan, et al.
Published: (2025)

Communication with Imperfectly Shared Randomness
by: Canonne, Clément L., et al.
Published: (2014)

Threshold rates for properties of random codes
by: Guruswami, Venkatesan, et al.
Published: (2020)

Bounds for list-decoding and list-recovery of random linear codes
by: Guruswami, Venkatesan, et al.
Published: (2020)

On Achievable Rates Over Noisy Nanopore Channels
by: Rameshwar, V. Arvind, et al.
Published: (2025)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
by: Alrabiah, Omar, et al.
Published: (2023)

MichelangeRoll: Sculpting Rational Distributions Exactly and Efficiently
by: Shao, Jui-Hsiang, et al.
Published: (2025)

On Counting Subsequences and Higher-Order Fibonacci Numbers
by: Wang, Hsin-Po, et al.
Published: (2024)

Toward Universal Decoding of Binary Linear Block Codes via Enhanced Polar Transformations
by: Lin, Chien-Ying, et al.
Published: (2025)

Explicit optimal-length locally repairable codes of distance 5
by: Beemer, Allison, et al.
Published: (2018)

The SIMO Block Rayleigh Fading Channel Capacity Scaling with Number of Antennas, Bandwidth and Coherence Length
by: Gomez-Cuba, Felipe
Published: (2022)

Maximum Channel Coding Rate of Finite Block Length MIMO Faster-Than-Nyquist Signaling
by: Zhang, Zichao, et al.
Published: (2024)

Variable-Length Joint Source-Channel Coding for Semantic Communication
by: Zhou, Yujie, et al.
Published: (2025)

On the Impact of Reactive Region on the Near-Field Channel Gain
by: Ouyang, Chongjun, et al.
Published: (2024)

Channel Gain Map Reconstruction Based on Virtual Scatterer Model
by: Sun, He, et al.
Published: (2026)

From Bit to Block: Decoding on Erasure Channels
by: Pfister, Henry D., et al.
Published: (2025)

Finite-Length Analysis of Polar Secrecy Codes for Wiretap Channels
by: Mahdavifar, Hessam, et al.
Published: (2024)

Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure
by: Lin, Mao-Chao, et al.
Published: (2025)