nhaliday + p:**   26

6.896: Essential Coding Theory
- probabilistic method and Chernoff bound for Shannon coding
- probabilistic method for asymptotically good Hamming codes (Gilbert coding)
- sparsity used for LDPC codes
mit  course  yoga  tcs  complexity  coding-theory  math.AG  fields  polynomials  pigeonhole-markov  linear-algebra  probabilistic-method  lecture-notes  bits  sparsity  concentration-of-measure  linear-programming  linearity  expanders  hamming  pseudorandomness  crypto  rigorous-crypto  communication-complexity  no-go  madhu-sudan  shannon  unit  p:**  quixotic 
february 2017 by nhaliday
COS597C: How to solve it
- Familiarity with tools. You have to know the basic mathematical and conceptuatl tools, and over the semester we will encounter quite a few of them.
- Background reading on your topic. What is already known and how was it proven? Research involves figuring out how to stand on the shoulders of others (could be giants, midgets, or normal-sized people).
- Ability to generate new ideas and spot the ones that dont work. I cannot stress the second part enough. The only way you generate new ideas is by shooting down the ones you already have.
- Flashes of genius. Somewhat overrated; the other three points are more important. Insights come to the well-prepared.
course  tcs  princeton  yoga  👳  unit  toolkit  metabuch  problem-solving  sanjeev-arora  wire-guided  s:*  p:** 
october 2016 by nhaliday

bundles : props

related tags

accretion  acm  akrasia  algebra  algebraic-complexity  algorithms  allodium  ankur-moitra  apollonian-dionysian  approximation  average-case  backup  berkeley  big-picture  bits  boaz-barak  books  boolean-analysis  bootstraps  caltech  circuits  clarity  coding-theory  cog-psych  communication-complexity  complexity  concentration-of-measure  concept  convexity-curvature  course  crypto  curvature  dana-moshkovitz  database  decision-making  deep-learning  differential  discipline  draft  duality  embeddings  encyclopedic  events  expanders  expert  expert-experience  exposition  fields  fourier  frontier  geometry  ground-up  growth  habit  hamming  harvard  hashing  hi-order-bits  hierarchy  hmm  huge-data-the-biggest  humility  information-theory  init  israel  jelani-nelson  learning-theory  lecture-notes  lectures  lifehack  linear-algebra  linear-programming  linearity  links  list  machine-learning  madhu-sudan  markov  math  math.AG  math.CA  math.CO  math.FA  math.GR  math.NT  mathtariat  meaningness  metabuch  mihai  mit  money-for-time  monte-carlo  multi  naturality  nibble  no-go  off-convex  oly  optimate  optimization  org:edu  org:health  org:inst  org:mat  org:rec  p:**  p:whenever  pcp  pdf  philosophy  pigeonhole-markov  polynomials  princeton  prioritizing  probabilistic-method  probability  problem-solving  productivity  proof-systems  pseudorandomness  psychology  quixotic  rand-approx  rand-complexity  random  reflection  reinforcement  relativization  research  rigorous-crypto  rounding  ryan-odonnell  s:*  salil-vadhan  sanjeev-arora  scholar  scholar-pack  self-control  seminar  shannon  skunkworks  space-complexity  sparsity  spearhead  spectral  stanford  stream  sublinear  submodular  synthesis  talks  tcs  tcstariat  texas  the-monster  the-prices  thinking  tidbits  toolkit  topics  topology  unit  valiant  video  virtu  volo-avolo  washington  wigderson  winter-2017  wire-guided  workshop  yoga  👳  🦉 

Copy this bookmark: