Masters Report
A report submitted in ful llment of the requirements
for the degree of Master of Science (50/50)
in the
Centre for Telecommunication Access and Services (CeTAS)
School of Electrical and Information Engineering
Faculty of Engineering and the Built Environment
February 2017 / Bounded distance decoding of Reed Solomon (RS) codes involves nding a unique
codeword if there is at least one codeword within the given distance. A corrupted
message having errors that is less than or equal to half the minimum distance cor-
responds to a unique codeword, and therefore will decode errors correctly using the
minimum distance decoder. However, increasing the decoding radius to be slightly
higher than half of the minimum distance may result in multiple codewords within
the Hamming sphere. The list decoding and syndrome extension methods provide a
maximum error correcting capability whereby the radius of the Hamming ball can be
extended for low rate RS codes. In this research, we study the probability of having
unique codewords for (7; k) RS codes when the decoding radius is increased from the
error correcting capability t to t + 1. Simulation results show a signi cant e ect of
the code rates on the probability of having unique codewords. It also shows that the
probability of having unique codeword for low rate codes is close to one. / MT2017
| Identifer | oai:union.ndltd.org:netd.ac.za/oai:union.ndltd.org:wits/oai:wiredspace.wits.ac.za:10539/22964 |
| Date | January 2017 |
| Creators | Babalola, Oluwaseyi Paul |
| Source Sets | South African National ETD Portal |
| Language | English |
| Detected Language | English |
| Type | Thesis |
| Format | Online resource (x, 53 leaves), application/pdf, application/pdf |
Page generated in 0.0019 seconds