From eec6292056e6f6d6aa9f52ed2b71585e60632568 Mon Sep 17 00:00:00 2001
From: Mohit Agarwal <mohit.agarwal@sky.com>
Date: Mon, 1 Jan 2024 18:55:33 +0000
Subject: Rewriting

---
 notes/data-rep.tex | 15 +++++++++------
 1 file changed, 9 insertions(+), 6 deletions(-)

(limited to 'notes/data-rep.tex')

diff --git a/notes/data-rep.tex b/notes/data-rep.tex
index f2f5ef4..7e93d0b 100644
--- a/notes/data-rep.tex
+++ b/notes/data-rep.tex
@@ -2,9 +2,9 @@
 
 \section{Metadata}
 
-Metadata means data about data. It is the information stored in a file
-that is not part of the main information, but instead important
-properties and data of the file, such as the author name of a PDF
+Metadata is data about data: it is information stored in a file
+that is not part of the main data, but instead 
+properties important to file, such as the author name of a PDF
 document. Although we do not take it into account when calculating
 file size, it is important to realise that in the real world, it would
 be there.
@@ -188,8 +188,11 @@ the sting would be $7\times 10 = 70\ bits$ (as there are 10
 characters).
 
 Using the Huffman tree we have generated we can encode $repetitive$ as 
-\begin{align*}
-    0100000101001110111001100
-\end{align*}
+
+
+\noindent\hspace*{0.3\textwidth}\texttt{0100000101001110111001100}\\
+        \hspace*{0.3\textwidth}\texttt{r\ \ \ e\ p\ \ \ e\ t\ i\ t\ i\ v\ \ e\ }
+
+
 This uses $25\ bits$, which is a $(70-25)\div(70)\times 100 \approx
 64.3\%$ saving.
-- 
cgit v1.2.3

