Deletion-Correcting Codes for the $\ell$-Symbol Read Channel
2026-06-26T08:51:40Z•03dd0a751ac4b46f955d44eb2d8c51cff6105a4257db7f2830659c89333d822e
Grassmannian-modulationMDS-array-codesMonte-CarloOAMPVAMPantenna-designcoding-theoryconvertible-codescoupling-efficiencydeletion-correcting-codesdistributed-storagegrouped-RISimportance-samplinglocally-repairable-codeslow-PAPRmultiuser-communicationsnanopore-sequencingoptical-communicationspartition-functionpinching-antennaracetrack-memoryrandom-precoding','bayes-optimal-inferencetiming-recoverywaveguideℓ-symbol-read-channel
What happened
Collection of new arXiv submissions (Jun 26 2026) across coding theory, communications, and inference. Key contributions: structural characterization and constructions of deletion-correcting codes for the ℓ-symbol read channel (applications: nanopore sequencing, racetrack memories) with low-redundancy single- and multi-deletion schemes; a constant-modulus, low-PAPR non-coherent Grassmannian modulation with a phase-blind timing-error detector for optical links; a measured-radiation-pattern-aware design and coupling-efficiency optimization for pinching-antenna waveguide systems; tight lower-bnds
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_math_it
- Record identifier
- 03dd0a751ac4b46f955d44eb2d8c51cff6105a4257db7f2830659c89333d822e
- Enrichment time
- 2026-06-26T08:51:40Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.