Recent years have seen dramatic growth in Internet usage and an increasing convergence between Internet and wireless communications. There has also been renewed interest in iteratively decoded low-density parity-check (LDPC) codes due to their capacity approaching performance on AWGN channels.

Thesis (M.S.)--West Virginia University, 2001. / Title from document title page. Document formatted into pages; contains vi, 68 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 67-68).

Thesis (Ph.D.)--McMaster University, 2005. / Supervisor: Xiaolin Wu. Includes bibliographical references (leaves 102-107).

Thesis (Ph. D.)--Massachusetts Institute of Technology, 2001. / "Dissertation ... written under the supervision of Madhu Sudan and submitted to MIT in August 2001"--P. xi. Includes bibliographical references and index.

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001. / "Dissertation ... written under the supervision of Madhu Sudan and submitted to MIT in August 2001"--P. xi. Includes bibliographical references and index.

Thesis (M. Eng.), Memorial University of Newfoundland, 1998. / Restricted until November 2000. Bibliography: leaves 116-127.

D.Ing. (Electrical And Electronic Engineering) / We address the issue of synchronization, using sync-words (or markers), for encoded data. We focus on data that is encoded using permutation codes or Reed-Solomon codes. For each type of code (permutation code and Reed-Solomon code) we give a synchronization procedure or algorithm such that synchronization is improved compared to when the procedure is not employed. The gure of merit for judging the performance is probability of synchronization (acquisition). The word acquisition is used to indicate that a sync-word is acquired or found in the right place in a frame. A new synchronization procedure for permutation codes is presented. This procedure is about nding sync-words that can be used speci cally with permutation codes, such that acceptable synchronization performance is possible even under channels with frequency selective fading/jamming, such as the power line communication channel. Our new procedure is tested with permutation codes known as distance-preserving mappings (DPMs). DPMs were chosen because they have de ned encoding and decoding procedures. Another new procedure for avoiding symbols in Reed-Solomon codes is presented. We call the procedure symbol avoidance. The symbol avoidance procedure is then used to improve the synchronization performance of Reed-Solomon codes, where known binary sync-words are used for synchronization. We give performance comparison results, in terms of probability of synchronization, where we compare Reed-Solomon with and without symbol avoidance applied.

Reliable communication is an important part of everyday living. When transmitting a message over a physical channel, noise is introduced that causes errors in the message. These errors can be inversion errors or synchronization errors. The aim of this thesis is to investigate coding techniques to minimise the effect of synchronization errors that occurred in a transmitted message. Watermarks are inserted into the encoded sequence. A neural network system is implemented before the decoder to detect the watermark and regain synchronization. / Prof. H. C. Ferreira

Mass., Massachusetts Inst. of Technology, Diss.--Cambridge, 2001. / Literaturverz. S. [337] - 347.

Please download dissertation to view abstract.