Insertion/deletion channels: reduced-state lower bounds on channel capacities

No abstract is available for this paper.

• Publication year

  2004

• Venue

  International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.

• Publication date

  2004-06-27

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ISIT.2004.1365266
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Simulation-based computation of information rates: upper and lower bounds

  2003cited by this paper
• On transmission over deletion channels

  2001cited by this paper

• Synchronization Error-Correction Coding Based on Probabilistic Inference and Sparse Matrices

  2022cites this paper
• Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage

  2021cites this paper
• An Overview of Capacity Results for Synchronization Channels

  2019cites this paper
• GreenFlag: Protecting 3D-Racetrack Memory from Shift Errors

  2019cites this paper
• Correcting Two Deletions and Insertions in Racetrack Memory

  2017cites this paper
• Trellis based lower bounds on capacities of channels with synchronization errors

  2015cites this paper
• Secrecy through Synchronization Errors

  2014cites this paper
• Audio Steganography using Convex Demixing

  2014cites this paper
• A Dissertation Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy

  2013cites this paper
• Writing on insertion paper

  2012cites this paper
• Bounds on the Capacity of Discrete Memoryless Channels Corrupted by Synchronization and Substitution Errors

  2012influential citation
• Bounds on the Capacity of Random Insertion and Deletion-Additive Noise Channels

  2011cites this paper
• Analytical Lower Bounds on the Capacity of Insertion and Deletion Channels

  2011cites this paper
• Achievable information rates for channels with insertions, deletions, and intersymbol interference with i.i.d. inputs

  2010cites this paper
• Communication over channels with symbol synchronization errors

  2008cites this paper
• Information rates for insertion/deletion channels with intersymbol interference

  2008cites this paper
• A Survey of Results for Deletion Channels and Related Synchronization Channels

  2008cites this paper
• On the Information Rates of Channels with Insertion/Deletion/Substitution Errors

  2008cites this paper
• Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels

  2007cites this paper
• Capacity Upper Bounds for the Deletion Channel

  2007cites this paper
• On the Information Stability of Channels With Timing Errors

  2006cites this paper
• A Simple Lower Bound for the Capacity of the Deletion Channel

  2006cites this paper
• On Lower Bounds for the Capacity of Deletion Channels

  2006cites this paper
• Bounds on mutual information rates of noisy channels with timing errors

  2005influential citation
• A cryptanalytic method for embedding video watermarks

  2005cites this paper
• On information transmission over a finite buffer channel

  2000cites this paper
• . By Theorem 5, we P

  year unknowncites this paper