• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 26
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 42
  • 42
  • 42
  • 19
  • 19
  • 16
  • 14
  • 11
  • 8
  • 8
  • 5
  • 5
  • 4
  • 4
  • 4
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Error control coding for mixed wireless and internet packet erasure channels

Aitken, D. G. January 2008 (has links)
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.
2

A simple and fast vector symbol Reed-Solomon burst error decoding method

Chang, Christopher. January 2008 (has links)
Thesis (M.S.)--Pennsylvania State University, 2008. / Mode of access: World Wide Web.
3

Binary mapping of nonbinary codes and soft decision decoding algorithms of Reed-Solomon codes based on bit reliability

Hu, Ta-Hsiang. January 2001 (has links)
Thesis (Ph. D.)--University of Hawaii at Manoa, 2001. / Includes bibliographical references (leaves 145-150). Also available on microfiche.
4

Propagation of updates to replicas using error correcting codes

Palaniappan, Karthik. January 2001 (has links)
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).
5

Algorithmic approaches to joint source-channel coding

Wang, Zhe. Wu, Xiaolin. January 1900 (has links)
Thesis (Ph.D.)--McMaster University, 2005. / Supervisor: Xiaolin Wu. Includes bibliographical references (leaves 102-107).
6

List decoding of error-correcting codes : winning thesis of the 2002 ACM doctoral dissertation competition /

Guruswami, Venkatesan, January 1900 (has links)
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.
7

List decoding of error-correcting codes winning thesis of the 2002 ACM doctoral dissertation competition /

Guruswami, Venkatesan. Sudan, Madhu. January 1900 (has links)
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.
8

A VLSI synthesis of a Reed-Solomon processor for digital communication systems /

Chose, Philemon John, January 1998 (has links)
Thesis (M. Eng.), Memorial University of Newfoundland, 1998. / Restricted until November 2000. Bibliography: leaves 116-127.
9

Synchronization with permutation codes and Reed-Solomon codes

Shongwe, Thokozani Calvin 23 September 2014 (has links)
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.
10

Reed-Solomon coding for power line communications and networks

Versfeld, Daniël Johannes Jacobus 06 June 2012 (has links)
D.Ing. / In this study we consider the application of Reed-Solomon codes on two distinct channels. The first channel is the packet erasure channel, where packets are either received errorfree,or packets are lost. The second channel is the power line channel where additive Gaussian noise,, impulsive noise and narrowband noise are encountered In this thesis we focus on M-FSK modulation for the power line channel. For the packet erasure channel,we develop two new erasures-only decoders .The distinction between the two decoders is that the one is optimized for burst erasure correction, while the second decoder is optimized for random erasure correction.It is found that for single burst erasures, or bursterasures contained within n - k elements (where n is the code length and k is the number of information elements to be encoded), the best performance is obtained with the burst erasure decoder. When used in conjunction with a modified interleaver found in the literature, the developed random erasure decoder yields the best all-round performance. The main contribution to the power line channel is the development of a combined demodulation and decoding strategy to detect narrowband interference When standard Reed-Solomon codes operate in a channel where narrowband interference is present, undetected errors result. With the proposed decoding strategy it is found that wideband noise (a generalization of impulsive noise) affects the performance more negatively than narrowband noise for M-FSK modulation. .

Page generated in 0.07 seconds