Capacity Upper Bounds for the Deletion Channel

No abstract is available for this paper.

• Publication year

  2007

• Venue

  2007 IEEE International Symposium on Information Theory

• Publication date

  2007-06-24

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ISIT.2007.4557469
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Capacity Bounds for Sticky Channels

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

  2007cited by this paper
• On Lower Bounds for the Capacity of Deletion Channels

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

  2006cited by this paper
• Insertion/deletion channels: reduced-state lower bounds on channel capacities

  2004cited by this paper
• On Single-Deletion-Correcting Codes

  2002cited by this paper
• On Transmission Over Deletion Channels

  2001cited by this paper
• On information transmission over a finite buffer channel

  2000cited by this paper
• Information transmission over a finite buffer channel

  2000cited by this paper
• Capacity per unit cost of a discrete memoryless channel

  1993cited by this paper
• Information Theory and Reliable Communication

  1968influential reference
• On the capabilities of codes to correct synchronization errors

  1967cited by this paper
• Binary codes capable of correcting deletions, insertions, and reversals

  1965cited by this paper
• SEQUENTIAL DECODING FOR BINARY CHANNELS WITH NOISE AND SYNCHRONIZATION ERRORS

  1961cited by this paper

• Characterization of Deletion/Substitution Channel Capacity for Small Deletion and Substitution Probabilities

  2025cites this paper
• On Achievable Rates Over Noisy Nanopore Channels

  2025cites this paper
• On the Capacity of Insertion Channels for Small Insertion Probabilities

  2025cites this paper
• Capacity Approximations for Insertion Channels With Small Insertion Probabilities

  2024cites this paper
• Mutual Information Upper Bounds for Uniform Inputs Through the Deletion Channel

  2024cites this paper
• Improved Upper and Lower Bounds on the Capacity of the Binary Deletion Channel

  2023cites this paper
• Upper bounds on the Rate of Uniformly-Random Codes for the Deletion Channel

  2022cites this paper
• On Models and Capacity Bounds for DNA-based Storage Channels

  2021cites this paper
• Algorithms for Reconstruction Over Single and Multiple Deletion Channels

  2020cites this paper
• Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels

  2019cites this paper
• Capacity Upper Bounds for Deletion-type Channels

  2019influential citation
• Expressions for the Entropy of Basic Discrete Distributions

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

  2019influential citation
• Symbolwise MAP for Multiple Deletion Channels

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

  2019cites this paper
• Codes for Synchronization in Channels and Sources with Edits

  2019cites this paper
• Fundamentals of Efficient Spectrum Access and Co-existence with Receiver Nonlinearity

  2018cites this paper
• Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels

  2018cites this paper
• Guess & check codes for deletions and synchronization

  2017cites this paper
• Models and Information-Theoretic Bounds for Nanopore Sequencing

  2017cites this paper
• Capacity upper bounds for deletion-type channels

  2017influential citation
• Polar Coding for the Binary Erasure Channel With Deletions

  2017cites this paper
• Guess & Check Codes for Deletions, Insertions, and Synchronization

  2017cites this paper
• Approximation in Synchronization and Computation

  2016cites this paper
• Recovery From Random Samples in a Big Data Set

  2015cites this paper
• Upper Bounds on the Capacity of Deletion Channels Using Channel Fragmentation

  2015cites this paper
• Capacity Upper Bounds on Binary Deletion Channels

  2014cites this paper
• On the Capacity of Channels with Synchronization Errors

  2013cites this paper
• Energy-efficient communication in the presence of synchronization errors

  2013cites this paper
• Optimal Coding for the Binary Deletion Channel With Small Deletion Probability

  2013cites this paper
• An improvement of the deletion channel capacity upper bound

  2013cites this paper
• An upper bound on the capacity of non-binary deletion channels

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

  2013cites this paper
• Improved capacity lower bounds for channels with deletions and insertions

  2013cites this paper
• On the Capacity of Channels With Timing Synchronization Errors

  2013cites this paper
• Intermittent Communication

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

  2012cites this paper
• Synchronization error channels & windowed decoding in theory & practice

  2012cites this paper
• Nonasymptotic Upper Bounds for Deletion Correcting Codes

  2012cites this paper
• Designing efficient codes for synchronization error channels

  2011cites this paper
• Bounds on the Optimal Rate for Synchronization from Deletions and Insertions

  2011cites this paper
• Evaluating the transmission rate of covert timing channels in a network

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

  2011cites this paper
• Modeling and information rates for synchronization error channels

  2011cites this paper
• Achievable Rates for Channels With Deletions and Insertions

  2011cites this paper
• Bounds on the Capacity of Random Insertion and Deletion-Additive Noise Channels

  2011cites this paper
• Bounds on the Capacity of Channels with Insertions, Deletions and Substitutions

  2011cites this paper
• Write Channel Model for Bit-Patterned Media Recording

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

  2010cites this paper
• Tight asymptotic bounds for the deletion channel with small deletion probabilities

  2010cites this paper
• Privacy Preserving Classification in Two-Dimension Distributed Data

  2010cites this paper
• Codes for Deletion and Insertion Channels With Segmented Errors

  2010cites this paper
• Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications

  2010cites this paper
• Upper Bounding the Deletion Channel Capacity by Auxiliary Memoryless Channels

  2009cites this paper
• Novel bounds on the capacity of binary channels with deletions and substitutions

  2009cites this paper
• A subsequence-histogram method for generic vocabulary recognition over deletion channels

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

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

  2008cites this paper
• Capacity Bounds for Sticky Channels

  2008cites this paper
• Novel Bounds on the Capacity of the Binary Deletion Channel

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

  2008cites this paper
• Codes for Deletion and Insertion Channels with Segmented Errors

  2007cites this paper