Using the First Order Reed-Muller Code for Channels With Unknown Offset

Bachelor thesis (2022)

Authors

B. van Prooijen Electrical Engineering, Mathematics and Computer Science

Contributors

J.H. Weber Discrete Mathematics and Optimization - EEMCS (mentor)
J.A.M. de Groot Mathematical Physics - EEMCS (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2022 Birgit van Prooijen
More Info
expand_more

Published Date

25-08-2022

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

While the Minimum Euclidean Distance detection is known to be optimal for channels affected by Gaussian noise, it has been shown that Minimum Pearson Distance detection (MPD) may perform better when the channel is also affected by an unknown offset, though for a good performance some adaptations for classical binary block codes are necessary. It is shown for cosets of first order Reed-Muller codes R(1,m) containing words of weight d/2, where d is the code's distance, that the minimum Pearson distance is always low for m≤4. However, it is possible to find cosets where the minimum Pearson distance is higher for m≥5.