Codes for Noisy Channels with unknown offset

Bachelor thesis (2020)

Authors

G. van Hemert Electrical Engineering, Mathematics and Computer Science

Contributors

J.H. Weber Discrete Mathematics and Optimization - EEMCS (supervisor 1)
R. Bu Discrete Mathematics and Optimization - EEMCS (supervisor 1)
Y. van Gennip Mathematical Physics - EEMCS (supervisor 2)
K.I. Aardal Discrete Mathematics and Optimization - EEMCS (supervisor 2)
Faculty
Electrical Engineering, Mathematics and Computer Science
Copyright: © 2020 G. van Hemert
More Info
expand_more

Published Date

15-07-2020

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

Storage systems, such as Flash memories, suffer, apart from the always present
noise, also from offset. The presence of this noise can decrease the performance
of a decoder using the Euclidean distance significantly. To negate the effects of
offset, a new distance, the modied Euclidean distance, was introduced, which
offers immunity to offset. However, the modified Euclidean distance is less
resistant to noise, which calls for methods to improve its resistance. The coset
of Hamming codes, constant weight codes and Berger codes are discussed and are simulated to investigate their performance with both distances. These codes are compared to each other for the Euclidean distance and the modified Euclidean
distance.