### Abstract

In this paper, we develop several lower bounds on the capacity of binary input symmetric q-ary output channels with synchronization errors, e.g., substitution/erasure channels with synchronization errors. More precisely, we show that if a channel with synchronization errors can be decomposed into a cascade of two independent channels where only the first one suffers from synchronization errors, a lower bound on its capacity related to the capacity of the one with only synchronization errors can be given. We present several examples with the new approach and demonstrate that for certain channels, e.g., deletion/substitution channel, it is possible to derive tighter capacity lower bounds than the existing ones.

Original language | English (US) |
---|---|

Title of host publication | 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012 |

Pages | 691-695 |

Number of pages | 5 |

DOIs | |

State | Published - Oct 22 2012 |

Event | 2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States Duration: Jul 1 2012 → Jul 6 2012 |

### Publication series

Name | IEEE International Symposium on Information Theory - Proceedings |
---|

### Other

Other | 2012 IEEE International Symposium on Information Theory, ISIT 2012 |
---|---|

Country | United States |

City | Cambridge, MA |

Period | 7/1/12 → 7/6/12 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics

## Fingerprint Dive into the research topics of 'On the capacity of binary input symmetric q-ary output channels with synchronization errors'. Together they form a unique fingerprint.

## Cite this

*2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012*(pp. 691-695). [6284303] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2012.6284303