rigorous-crypto   32

Merkle tree - Wikipedia
In cryptography and computer science, a hash tree or Merkle tree is a tree in which every non-leaf node is labelled with the hash of the labels or values (in case of leaves) of its child nodes.
concept  cs  data-structures  bitcoin  cryptocurrency  blockchain  atoms  protocol  wiki  reference  nibble  hashing  ideas  crypto  rigorous-crypto 
june 2017 by nhaliday
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

related tags

aaronson  academia  algebraic-complexity  algorithmic-econ  algorithms  analysis  announcement  approximation  arrows  atoms  berkeley  big-picture  big-surf  bitcoin  bits  blockchain  boaz-barak  boolean-analysis  caltech  carmack  circuits  coding-theory  commentary  communication-complexity  complexity  computation  concentration-of-measure  concept  conceptual-vocab  conference  contrarianism  cornell  counting  course  critique  crypto  cryptocurrency  cs  dana-moshkovitz  data-structures  database  decentralized  decision-theory  deep-learning  dimensionality  discovery  distributed  duality  engineering  equilibrium  error  essay  evidence  expanders  expert-experience  expert  explanation  fields  frontier  game-theory  gowers  gradient-descent  ground-up  gwern  hamming  hard-core  hardness  harvard  hashing  heuristic  high-dimension  hn  homepage  huge-data-the-biggest  ideas  information-theory  init  innovation  insight  jargon  learning-theory  lecture-notes  lectures  lens  linear-algebra  linear-programming  linearity  liner-notes  links  list  lower-bounds  luca-trevisan  machine-learning  madhu-sudan  markov  math.ag  math.gr  math.nt  mathtariat  matrix-factorization  metabuch  minimum-viable  mit  models  motivation  naturality  nibble  no-go  novelty  ocw  oly  online-learning  open-problems  operational  org:bleg  org:edu  org:junk  overflow  p2p  p:***  p:**  p:someday  p:whenever  papers  pcp  pigeonhole-markov  polynomials  postmortem  pragmatic  princeton  probabilistic-method  proof-systems  protocol  pseudorandomness  publishing  q-n-a  quantum-info  quantum-money  quantum  questions  quixotic  rand-approx  rand-complexity  random  ratty  reduction  reference  reflection  relativization  research  rhetoric  roots  ryan-odonnell  salil-vadhan  sampling  sanjeev-arora  scholar  sdp  shannon  shipping  space-complexity  sparsity  spectral  stanford  stream  synthesis  szabo  talks  tcs  tcstariat  technology  thinking  tidbits  toolkit  top-n  topics  turing  ugc  unit  valiant  wigderson  wiki  yoga  👳 

Copy this bookmark: