[{"title":"( 29 个子文件 4.25MB ) Essential Coding Theory, Fall 2004","children":[{"title":"lect03slx4pdf--More on Shannon’s theory.PDF <span style='color:#111;'> 113.55KB </span>","children":null,"spread":false},{"title":"lect01slx4--Hamming’s Problem (1940s).PDF <span style='color:#111;'> 116.27KB </span>","children":null,"spread":false},{"title":"lect13--algebraic geometry codes.PDF <span style='color:#111;'> 431.79KB </span>","children":null,"spread":false},{"title":"lect10--random error case.PDF <span style='color:#111;'> 304.70KB </span>","children":null,"spread":false},{"title":"lect18--Use of randomness.PDF <span style='color:#111;'> 274.44KB </span>","children":null,"spread":false},{"title":"lect14--Graph-Theoretic Codes.PDF <span style='color:#111;'> 267.43KB </span>","children":null,"spread":false},{"title":"lect07--Abstracting the Welch Berlekamp algorithm.PDF <span style='color:#111;'> 142.22KB </span>","children":null,"spread":false},{"title":"lect05slx4--The story so far.PDF <span style='color:#111;'> 125.80KB </span>","children":null,"spread":false},{"title":"lect05--Algebraic Codes.PDF <span style='color:#111;'> 169.58KB </span>","children":null,"spread":false},{"title":"lect01--Overview of Class.PDF <span style='color:#111;'> 139.75KB </span>","children":null,"spread":false},{"title":"lect12--Nonconstructive Results on List Decoding.PDF <span style='color:#111;'> 276.74KB </span>","children":null,"spread":false},{"title":"lect03--Shannon’s Converse Theorem.PDF <span style='color:#111;'> 144.67KB </span>","children":null,"spread":false},{"title":"lect04--Parameters of a Code.PDF <span style='color:#111;'> 111.12KB </span>","children":null,"spread":false},{"title":"lect09--Recap.PDF <span style='color:#111;'> 322.83KB </span>","children":null,"spread":false},{"title":"ps2--Problem Set 2.PDF <span style='color:#111;'> 107.82KB </span>","children":null,"spread":false},{"title":"lect11--The Plotkin’s Bound.PDF <span style='color:#111;'> 339.21KB </span>","children":null,"spread":false},{"title":"lect06--Decoding linear codes.PDF <span style='color:#111;'> 111.90KB </span>","children":null,"spread":false},{"title":"lect19--Extractors.PDF <span style='color:#111;'> 204.85KB </span>","children":null,"spread":false},{"title":"lect02--Shannon’s theory of information.PDF <span style='color:#111;'> 104.78KB </span>","children":null,"spread":false},{"title":"lect23--zig-zag product.PDF <span style='color:#111;'> 253.98KB </span>","children":null,"spread":false},{"title":"lect04slx4--Asymptotically good codes.PDF <span style='color:#111;'> 50.33KB </span>","children":null,"spread":false},{"title":"lect15--Tanner product generalization.PDF <span style='color:#111;'> 243.40KB </span>","children":null,"spread":false},{"title":"ps1--ProblemSet1.PDF <span style='color:#111;'> 166.95KB </span>","children":null,"spread":false},{"title":"lect22--T-Z-S Continued.PDF <span style='color:#111;'> 273.63KB </span>","children":null,"spread":false},{"title":"lect02slx4--Shannon’s Framework (1948).PDF <span style='color:#111;'> 139.78KB </span>","children":null,"spread":false},{"title":"lect17--Alon et al [ABNNR] code construction.PDF <span style='color:#111;'> 253.18KB </span>","children":null,"spread":false},{"title":"lect21--Trevisan’s Extractor.PDF <span style='color:#111;'> 330.70KB </span>","children":null,"spread":false},{"title":"lect08--List Decoding of Reed-Solomon Codes.PDF <span style='color:#111;'> 164.48KB </span>","children":null,"spread":false},{"title":"lect16--Spielman codes.PDF <span style='color:#111;'> 265.95KB </span>","children":null,"spread":false}],"spread":true}]