All public logs
Jump to navigation
Jump to search
Combined display of all available logs of Microlab Classes. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)- 11:15, 19 April 2021 Adrian Vidal talk contribs created page Jointly typical sequences (Created page with "== Definition == == Illustration == == Example: Binary symmetric channel ==")
- 15:55, 12 April 2021 Adrian Vidal talk contribs created page 161-A4.2 (Created page with "== The Typical Set Encoder == To transmit <math>k</math> bits of information, we can draw a symbol from a <math>2^k</math>-ary source alphabet <math>\{1, 2, 3, ..., 2^{k}\}</m...")
- 14:35, 27 March 2021 Adrian Vidal talk contribs created page 161-A3.2 (Created page with "== Exercises == # (3 points) Let <math>X,Y</math> be independent and uniformly distributed random variables over the common alphabet <math>\{0, 1\}</math>, and define a third...")
- 01:51, 25 March 2021 Adrian Vidal talk contribs created page Nonnegativity of Information Measures (Created page with "== Information Divergence is Nonnegative== Let <math>p,q</math> be two different probability distributions over a discrete alphabet <math>\mathcal{X}</math>. The relative entr...")
- 10:29, 24 March 2021 Adrian Vidal talk contribs created page Independence and Markov Chains (Created page with "== Independence as factorability == If <math>X</math> and <math>Y</math> are discrete random variables, we can use Bayes' theorem to write their joint distribution as <math>p...")
- 10:12, 24 March 2021 Adrian Vidal talk contribs created page File:Markov-chain.svg
- 10:12, 24 March 2021 Adrian Vidal talk contribs uploaded File:Markov-chain.svg
- 07:31, 15 March 2021 Adrian Vidal talk contribs created page 161-A2.3 (Created page with "== Exercise 2.2. Huffman encoding == If we can model our information source as discrete and memoryless, Huffman codes will provide a prefix-free encoding that has the minimum...")
- 07:22, 15 March 2021 Adrian Vidal talk contribs created page 161-A2.2 (Created page with "Prefix-free codes are codes in which no codeword is a prefix of another codeword. This restriction allows for instantaneous decoding. In this exercise, you will be using a dec...")
- 04:33, 15 March 2021 Adrian Vidal talk contribs created page Uniquely Decodable Codes (Created page with "== Special Case: Prefix-Free Codes == == The Kraft-McMillan Inequality == The Kraft-McMillan inequality provides (1) a necessary condition for unique decodability, and (2) a...")
- 03:06, 15 March 2021 Adrian Vidal talk contribs created page Huffman codes (Created page with "== Construction == File:Huffman-example.svg == Optimality == The optimality of the Huffman code hinges on the following two properties of optimal prefix-free codes: * *...")
- 01:48, 15 March 2021 Adrian Vidal talk contribs created page Source coding (Created page with " == A First Look at Shannon's Communication Theory == thumb|500px|Figure 1: A general communication system<ref name="shannon1948"/>. In his...")
- 01:05, 15 March 2021 Adrian Vidal talk contribs created page File:Huffman-example.svg
- 01:05, 15 March 2021 Adrian Vidal talk contribs uploaded File:Huffman-example.svg
- 00:16, 15 March 2021 Adrian Vidal talk contribs created page File:Prefix-tree-examples.svg
- 00:16, 15 March 2021 Adrian Vidal talk contribs uploaded File:Prefix-tree-examples.svg
- 23:51, 14 March 2021 Adrian Vidal talk contribs created page File:Code-hierarchy.svg
- 23:51, 14 March 2021 Adrian Vidal talk contribs uploaded File:Code-hierarchy.svg
- 23:41, 14 March 2021 Adrian Vidal talk contribs created page File:Prefix-code-tree.svg
- 23:41, 14 March 2021 Adrian Vidal talk contribs uploaded File:Prefix-code-tree.svg
- 12:26, 6 March 2021 Adrian Vidal talk contribs created page Conditional Entropy and Mutual Information (Created page with "When we work with multiple information sources (random variables) <math>X</math> and <math>Y</math>, the following details are useful: * How much information overlap is there...")
- 12:23, 6 March 2021 Adrian Vidal talk contribs created page File:Venn diagram joint entropy.svg
- 12:23, 6 March 2021 Adrian Vidal talk contribs uploaded File:Venn diagram joint entropy.svg
- 12:22, 6 March 2021 Adrian Vidal talk contribs created page File:Venn diagram.svg
- 12:22, 6 March 2021 Adrian Vidal talk contribs uploaded File:Venn diagram.svg
- 23:27, 2 March 2021 Adrian Vidal talk contribs created page Entropy (Created page with "== Definition == In information theory, we always work with random variables. In his landmark paper, Shannon introduced a function <math>H</math> that takes in a random variab...")
- 13:04, 2 March 2021 Adrian Vidal talk contribs created page 161-A1.2 (Created page with "==A unified view of random variables== In EEE 137, you were first introduced to a `single` random variable <math>X</math> and then later taught to deal with `multiple` random...")
- 12:31, 2 March 2021 Adrian Vidal talk contribs uploaded a new version of File:Stem-plot.png
- 12:28, 2 March 2021 Adrian Vidal talk contribs created page File:Stem-plot.png
- 12:28, 2 March 2021 Adrian Vidal talk contribs uploaded File:Stem-plot.png
- 12:26, 2 March 2021 Adrian Vidal talk contribs created page File:Stem-plot.svg
- 12:26, 2 March 2021 Adrian Vidal talk contribs uploaded File:Stem-plot.svg
- 12:36, 1 March 2021 Adrian Vidal talk contribs created page 161-A1.0 (Created page with "Each programming exercise will have the following elements: * a problem specification, * a prescribed function name and argument list, and * some header script that will be in...")
- 12:21, 23 February 2021 Adrian Vidal talk contribs created page File:Typical-set-decoding.svg
- 12:21, 23 February 2021 Adrian Vidal talk contribs uploaded File:Typical-set-decoding.svg
- 20:35, 12 February 2021 Adrian Vidal talk contribs moved page Adrian's Sandbox to Talk:Adrian's Sandbox (Accidentally created a public page)
- 20:33, 12 February 2021 Adrian Vidal talk contribs created page Adrian's Sandbox (Created page with "[flag|private] 800px")
- 11:31, 12 February 2021 Adrian Vidal talk contribs created page File:Typical-set-decoding.tiff (TIF version of typical set)
- 11:31, 12 February 2021 Adrian Vidal talk contribs uploaded File:Typical-set-decoding.tiff (TIF version of typical set)
- 11:24, 12 February 2021 Adrian Vidal talk contribs uploaded a new version of File:Typical-set-decoding.png (PNG-24 version of typical set)
- 11:21, 12 February 2021 Adrian Vidal talk contribs created page File:Typical-set-decoding.png (PNG version of typical set (pdf preview not supported))
- 11:21, 12 February 2021 Adrian Vidal talk contribs uploaded File:Typical-set-decoding.png (PNG version of typical set (pdf preview not supported))
- 11:08, 12 February 2021 Adrian Vidal talk contribs created page File:Polar-transform.pdf (Polar transform applied to two channel copies.)
- 11:08, 12 February 2021 Adrian Vidal talk contribs uploaded File:Polar-transform.pdf (Polar transform applied to two channel copies.)
- 11:06, 12 February 2021 Adrian Vidal talk contribs created page File:Channel-coding-proof-b.pdf (Input codewords with overlapping typical sets in the output set.)
- 11:06, 12 February 2021 Adrian Vidal talk contribs uploaded File:Channel-coding-proof-b.pdf (Input codewords with overlapping typical sets in the output set.)
- 11:05, 12 February 2021 Adrian Vidal talk contribs created page File:Channel-coding-proof-a.pdf (Input codewords which have disjoint typical sets in the output set.)
- 11:05, 12 February 2021 Adrian Vidal talk contribs uploaded File:Channel-coding-proof-a.pdf (Input codewords which have disjoint typical sets in the output set.)
- 11:02, 12 February 2021 Adrian Vidal talk contribs created page File:Typical-set-decoding.pdf (Illustration of Shannon's random coding argument. Decoding succeeds if there is a unique codeword that is jointly typical with the channel output.)
- 11:02, 12 February 2021 Adrian Vidal talk contribs uploaded File:Typical-set-decoding.pdf (Illustration of Shannon's random coding argument. Decoding succeeds if there is a unique codeword that is jointly typical with the channel output.)
