On the information rates of channels with insertion/deletion/substitution errors

Jun Hu; Tolga M. Duman; M. Fatih Erden

doi:10.1109/ICC.2008.187

On the information rates of channels with insertion/deletion/substitution errors

Jun Hu, Tolga M. Duman, M. Fatih Erden

Electrical, Computer, and Energy Engineering, School of (IAFSE-ECEE)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Scopus citations

Abstract

In this work, we propose to use trellis structures to characterize channels with insertions, deletions and substitutions. We start with binary-input binary-output channels with either insertions or deletions, and develop a simulation based approach to estimate the corresponding information rates. This approach is then generalized to the case where there exist both insertions and deletions. We show that, the proposed algorithm is an efficient and flexible technique to closely estimate the information rates for channels with insertions, deletions and substitutions.

Original language	English (US)
Title of host publication	ICC 2008 - IEEE International Conference on Communications, Proceedings
Pages	956-960
Number of pages	5
DOIs	https://doi.org/10.1109/ICC.2008.187
State	Published - 2008
Event	IEEE International Conference on Communications, ICC 2008 - Beijing, China Duration: May 19 2008 → May 23 2008

Publication series

Name	IEEE International Conference on Communications
ISSN (Print)	0536-1486

Other

Other	IEEE International Conference on Communications, ICC 2008
Country/Territory	China
City	Beijing
Period	5/19/08 → 5/23/08

Keywords

Information rates
Insertion/deletion/substitution channels
Trellis

ASJC Scopus subject areas

Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/ICC.2008.187

Cite this

Hu, J, Duman, TM & Erden, MF 2008, On the information rates of channels with insertion/deletion/substitution errors. in ICC 2008 - IEEE International Conference on Communications, Proceedings., 4533223, IEEE International Conference on Communications, pp. 956-960, IEEE International Conference on Communications, ICC 2008, Beijing, China, 5/19/08. https://doi.org/10.1109/ICC.2008.187

@inproceedings{02fdfc8de81c4bc194cee1314902f125,

title = "On the information rates of channels with insertion/deletion/substitution errors",

abstract = "In this work, we propose to use trellis structures to characterize channels with insertions, deletions and substitutions. We start with binary-input binary-output channels with either insertions or deletions, and develop a simulation based approach to estimate the corresponding information rates. This approach is then generalized to the case where there exist both insertions and deletions. We show that, the proposed algorithm is an efficient and flexible technique to closely estimate the information rates for channels with insertions, deletions and substitutions.",

keywords = "Information rates, Insertion/deletion/substitution channels, Trellis",

author = "Jun Hu and Duman, {Tolga M.} and Erden, {M. Fatih}",

year = "2008",

doi = "10.1109/ICC.2008.187",

language = "English (US)",

isbn = "9781424420742",

series = "IEEE International Conference on Communications",

pages = "956--960",

booktitle = "ICC 2008 - IEEE International Conference on Communications, Proceedings",

note = "IEEE International Conference on Communications, ICC 2008 ; Conference date: 19-05-2008 Through 23-05-2008",

}

TY - GEN

T1 - On the information rates of channels with insertion/deletion/substitution errors

AU - Hu, Jun

AU - Duman, Tolga M.

AU - Erden, M. Fatih

PY - 2008

Y1 - 2008

N2 - In this work, we propose to use trellis structures to characterize channels with insertions, deletions and substitutions. We start with binary-input binary-output channels with either insertions or deletions, and develop a simulation based approach to estimate the corresponding information rates. This approach is then generalized to the case where there exist both insertions and deletions. We show that, the proposed algorithm is an efficient and flexible technique to closely estimate the information rates for channels with insertions, deletions and substitutions.

AB - In this work, we propose to use trellis structures to characterize channels with insertions, deletions and substitutions. We start with binary-input binary-output channels with either insertions or deletions, and develop a simulation based approach to estimate the corresponding information rates. This approach is then generalized to the case where there exist both insertions and deletions. We show that, the proposed algorithm is an efficient and flexible technique to closely estimate the information rates for channels with insertions, deletions and substitutions.

KW - Information rates

KW - Insertion/deletion/substitution channels

KW - Trellis

UR - http://www.scopus.com/inward/record.url?scp=51249083678&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51249083678&partnerID=8YFLogxK

U2 - 10.1109/ICC.2008.187

DO - 10.1109/ICC.2008.187

M3 - Conference contribution

AN - SCOPUS:51249083678

SN - 9781424420742

T3 - IEEE International Conference on Communications

SP - 956

EP - 960

BT - ICC 2008 - IEEE International Conference on Communications, Proceedings

T2 - IEEE International Conference on Communications, ICC 2008

Y2 - 19 May 2008 through 23 May 2008

ER -

On the information rates of channels with insertion/deletion/substitution errors

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this