clean up latex header
This commit is contained in:
@@ -43,6 +43,13 @@
|
|||||||
url = "https://en.wikipedia.org/w/index.php?title=Arithmetic_coding&oldid=1320999535",
|
url = "https://en.wikipedia.org/w/index.php?title=Arithmetic_coding&oldid=1320999535",
|
||||||
note = "[Online; accessed 26-November-2025]"
|
note = "[Online; accessed 26-November-2025]"
|
||||||
}
|
}
|
||||||
|
@misc{ enwiki:kraft-mcmillan,
|
||||||
|
author = "{Wikipedia contributors}",
|
||||||
|
title = "Kraft–McMillan inequality --- {Wikipedia}{,} The Free Encyclopedia",
|
||||||
|
year = "2025",
|
||||||
|
url = "https://en.wikipedia.org/w/index.php?title=Kraft%E2%80%93McMillan_inequality&oldid=1313803157",
|
||||||
|
note = "[Online; accessed 26-November-2025]"
|
||||||
|
}
|
||||||
@misc{ dewiki:shannon-fano,
|
@misc{ dewiki:shannon-fano,
|
||||||
author = "Wikipedia",
|
author = "Wikipedia",
|
||||||
title = "Shannon-Fano-Kodierung --- Wikipedia{,} die freie Enzyklopädie",
|
title = "Shannon-Fano-Kodierung --- Wikipedia{,} die freie Enzyklopädie",
|
||||||
@@ -64,3 +71,10 @@
|
|||||||
url = "https://de.wikipedia.org/w/index.php?title=Lempel-Ziv-Welch-Algorithmus&oldid=251943809",
|
url = "https://de.wikipedia.org/w/index.php?title=Lempel-Ziv-Welch-Algorithmus&oldid=251943809",
|
||||||
note = "[Online; Stand 26. November 2025]"
|
note = "[Online; Stand 26. November 2025]"
|
||||||
}
|
}
|
||||||
|
@misc{ dewiki:kraft-mcmillan,
|
||||||
|
author = "Wikipedia",
|
||||||
|
title = "Kraft-Ungleichung --- Wikipedia{,} die freie Enzyklopädie",
|
||||||
|
year = "2018",
|
||||||
|
url = "https://de.wikipedia.org/w/index.php?title=Kraft-Ungleichung&oldid=172862410",
|
||||||
|
note = "[Online; Stand 26. November 2025]"
|
||||||
|
}
|
||||||
@@ -1,28 +1,30 @@
|
|||||||
\documentclass{article}
|
\documentclass{article}
|
||||||
|
%%% basic layouting
|
||||||
\usepackage[utf8x]{inputenc}
|
\usepackage[utf8x]{inputenc}
|
||||||
\usepackage[margin=1in]{geometry} % Adjust margins
|
\usepackage[margin=1in]{geometry} % Adjust margins
|
||||||
\usepackage{caption}
|
\usepackage{caption}
|
||||||
|
\usepackage{hyperref}
|
||||||
|
\PassOptionsToPackage{hyphens}{url} % allow breaking urls
|
||||||
|
\usepackage{float}
|
||||||
\usepackage{wrapfig}
|
\usepackage{wrapfig}
|
||||||
\usepackage{subcaption}
|
\usepackage{subcaption}
|
||||||
\usepackage{parskip} % dont indent after paragraphs, figures
|
\usepackage{parskip} % dont indent after paragraphs, figures
|
||||||
\usepackage{xcolor}
|
\usepackage{xcolor}
|
||||||
|
%%% algorithms
|
||||||
\usepackage{algorithm}
|
\usepackage{algorithm}
|
||||||
\usepackage{algpseudocodex}
|
\usepackage{algpseudocodex}
|
||||||
%\usepackage{csquotes} % Recommended for biblatex
|
% graphs and plots
|
||||||
\usepackage{tikz}
|
\usepackage{tikz}
|
||||||
\usepackage{pgfplots}
|
\usepackage{pgfplots}
|
||||||
\usetikzlibrary{positioning}
|
\usetikzlibrary{positioning}
|
||||||
%\usegdlibrary{trees}
|
%\usegdlibrary{trees}
|
||||||
\usepackage{float}
|
%%% math
|
||||||
\usepackage{amsmath}
|
\usepackage{amsmath}
|
||||||
\PassOptionsToPackage{hyphens}{url}
|
%%% citations
|
||||||
\usepackage{hyperref} % allows urls to follow line breaks of text
|
|
||||||
\usepackage[style=ieee, backend=biber, maxnames=1, minnames=1]{biblatex}
|
\usepackage[style=ieee, backend=biber, maxnames=1, minnames=1]{biblatex}
|
||||||
|
%\usepackage{csquotes} % Recommended for biblatex
|
||||||
\addbibresource{compression.bib}
|
\addbibresource{compression.bib}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
\title{Compression}
|
\title{Compression}
|
||||||
\author{Erik Neller}
|
\author{Erik Neller}
|
||||||
\date{\today}
|
\date{\today}
|
||||||
@@ -55,8 +57,7 @@ This is an intuitive approach as more frequent symbols have a higher impact on a
|
|||||||
|
|
||||||
|
|
||||||
\section{Kraft-McMillan inequality}
|
\section{Kraft-McMillan inequality}
|
||||||
% https://de.wikipedia.org/wiki/Kraft-Ungleichung
|
|
||||||
% https://en.wikipedia.org/wiki/Kraft%E2%80%93McMillan_inequality
|
|
||||||
\section{Shannon-Fano}
|
\section{Shannon-Fano}
|
||||||
Shannon-Fano coding is one of the earliest methods for constructing prefix codes.
|
Shannon-Fano coding is one of the earliest methods for constructing prefix codes.
|
||||||
It divides symbols into groups based on their probabilities, recursively partitioning them to assign shorter codewords
|
It divides symbols into groups based on their probabilities, recursively partitioning them to assign shorter codewords
|
||||||
|
|||||||
Reference in New Issue
Block a user