Name
Abstract | ||
|---|---|---|
The notions of decodability and error correction for information transmission over general noisy channels — including channels with deletions and insertions of symbols — are investigated with the goal of constructing -decodable codes for a given channel , that is, codes that correct errors, hence uniquely decode even in the presence of errors. In contrast to most of the classical theory of error correcting codes, we consider not only block codes, but also codes containing words with different lengths in this context. Several general conditions and examples are provided that are valid for arbitrary channels. We explain some of the new techniques for the case of channels with deletions. In particular, we provide a construction method for a large class of codes that are error correcting for such channels. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/3-540-60084-1_107 | ICALP |
Keywords | Field | DocType |
variable-length codes,error correction,error correction code,variable length code,block codes | Hamming code,Discrete mathematics,Concatenated error correction code,Low-density parity-check code,Computer science,Serial concatenated convolutional codes,Block code,Turbo code,Algorithm,Error detection and correction,Linear code | Conference |
Volume | ISSN | ISBN |
944 | 0302-9743 | 3-540-60084-1 |
Citations | PageRank | References |
6 | 0.67 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Helmut Jürgensen | 1 | 208 | 43.68 |
| Stavros Konstantinidis | 2 | 283 | 31.10 |