Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Electronic and Information Engineering | en_US |
| dc.contributor.advisor | Lau, C. M. Francis (EIE) | en_US |
| dc.creator | Xue, Tianbo | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/12437 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | en_US |
| dc.rights | All rights reserved | en_US |
| dc.title | Error correction codes for channels with insertion, deletion and substitution errors | en_US |
| dcterms.abstract | Error correction codes play an important role in protecting the integrity and accuracy of data transmitted in digital communication systems and data kept in storage systems. Besides substitution errors caused by noise, insertion and deletion errors may occur. Insertion and deletion errors are also categorized as synchronization errors because they affect the synchronization of a communication channel. Some recent studies have focused on coding against insertions and deletions due to some specific practical communication and storage applications. Unlike error correction codes for substitution errors, codes for insertion and deletion errors are limited. The thesis is therefore devoted to the study of error correction codes for channels impaired by insertion, deletion and substitution errors. | en_US |
| dcterms.abstract | We first propose a new class of systematic comma-free code which can recover synchronization efficiently after insertion, deletion and substitution errors occur. The proposed code provides more choices in designing synchronization codes, and includes the classical F code as a special case. Then, we investigate codes that can correct insertion, deletion and substitution errors. We optimize the inner code of the classic Davey MacKay watermark code by proposing a soft-decision decoding based on a new metric and by enhancing the inner sparsified codebook based on better distance property and lowest-density property. We further propose a concatenated code composed of an RS outer code and a marker inner code. The proposed code not only is effective in correcting multiple insertion, deletion and substitution errors, but possesses a lower complexity decoding algorithm. | en_US |
| dcterms.abstract | Finally, we propose codes for practical systems. We propose a probabilistic channel model with correlated insertion and deletion errors, in addition to substitution errors. The channel model captures the data dependence adapted to applications such as the write channel in bit-patterned media recording systems. We also investigate the performance of a concatenated code, consisting of an outer low-density parity-check code and an inner marker code, over this channel. DNA-based data storage systems have become a hot research topic recently. Here, we propose a systematic error correction code that can combat insertion, deletion and substitution errors. By combining this code with a proposed modulation scheme, we construct GC-balanced DNA sequences with error correction capability. | en_US |
| dcterms.abstract | Throughout our investigations, computer simulations are used to evaluate the performance of the proposed error correction codes. Moreover, theoretical analyses are given whenever appropriate. | en_US |
| dcterms.extent | xxii, 127 pages : color illustrations | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2023 | en_US |
| dcterms.educationalLevel | M.Phil. | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.LCSH | Error-correcting codes (Information theory) | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | open access | en_US |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/12437