Correct thesis report

Signed-off-by: Severin Kaderli <severin@kaderli.dev>

documentation/thesis/content/02_preliminaries.tex

@@ -49,8 +49,8 @@ transmission, the checksum that was transmitted with the message, and the
 checksum that is calculated from the received message are compared, if they
 don't match, the message contains an error.
 
-For calculating a \gls{crc} value message, which is treated as a binary
-polynomial is divided by another value, to so-called generator polynomial. The
+For calculating a \gls{crc} value, the message, which is treated as a binary
+number, is divided by another value, the so-called generator polynomial. The
 remainder of this division is the checksum value. The order of the generator
 polynomial defines the bit-length of the resulting checksum \cite{crcGuide}. 
 
@@ -72,7 +72,7 @@ Because of these small variations, there are many implementations of
 
 The specific algorithm used in this thesis is the CRC-8-AUTOSAR algorithm with
 the polynomial $x^{8} + x^{5} + x^{3} + + x^{2} + x + 1$ and an initial value
-of $\mathtt{0xFF}$. This algorithm is created by AUTOSAR \cite{AutosarCrc} and
+of $\mathtt{0xFF}$. This algorithm was created by AUTOSAR \cite{AutosarCrc} and
 according to the CRC Polynomial Zoo, it can detect up to 4 single bit errors in
 a message length of 119 bits \cite{CrcPolynomialZoo}. As our maximum payload
 size is 128-bit, this is a fitting CRC algorithm to use. 
@@ -85,7 +85,7 @@ to implement. \cite{Crc}
 Manchester is a simple encoding code for the transmission of binary data. The
 data is encoded in the transitions of the signal instead of simple high or low
 values. A transition from low to high indicates a 0 and a transition from high
-to low indicates a 1 in the original definition by G. E. Thomas, in the
+to low indicates a 1 in the original definition by G. E. Thomas. In the
 definition from IEEE the values of the transitions are swapped
 (see \autoref{figure:manchester_code}).
 
@@ -95,13 +95,13 @@ definition from IEEE the values of the transitions are swapped
     \label{figure:manchester_code}
 \end{figure}
 
-The advantages of manchester encoding are that there are no prolonged high or
-low signals and the original clock signal can be extracted from the signal and
-doesn't need to be synchronized between the sender and receiver, on the other
-side the bandwidth requirements are doubled as two bits in the signal are
+The advantages of manchester encoding are, that there are no prolonged high or
+low signals. Furthermore, the original clock signal can be extracted from the signal and
+doesn't need to be synchronized between the sender and receiver. On the other
+side the bandwidth requirements are doubled as two code bits in the signal are
 needed to encode one bit of the original data \cite{manchesterCode}.
 
-For the work in this thesis, we use the definition of Manchester Code by G.E
+For the work in this thesis, I use the definition of Manchester Code by G.E
 Thomas.
 
 \section{Web Worker}
@@ -111,7 +111,5 @@ threads in the browser. This way you can run CPU intensive processes without
 stalling the main thread and locking up the UI.
 
 There are a few limitations with Web Workers. A Web Worker doesn't have access
-to the \gls{dom}, to the window object and to some web APIs.
-
-The main thread and Web Workers can communicate together using messages.
-\cite{WebWorkers}
+to the \gls{dom}, to the window object, and to some web APIs. The communication
+between the main thread, and the web workers occurs via messages \cite{WebWorkers}.