Скачать или смотреть А. Фролов Approximate Support Recovery

00:00:00 - Введение
00:07:30 - Massive MTC(Machine-type Communications)
00:13:30 - LPWAN(Low-power wide area network)
00:14:24 - Task: Unsourced random access
00:18:10 - Computing probability of error
00:20:10 - Energy per bit
00:20:36 - Compressed sensing analogy
00:24:00 - объяснение на доске
00:36:08 - Restricterd isometry property
00:39:50 - Notation
00:42:21 - Decoding algorithms
00:46:00 - error condition
00:51:30 - P_e estimate
00:57:10 - Probabilistic method of random coding
01:01:57 - Naive approach: pure union bound
01:08:40 - Gallager's trick
01:12:07 - Random coding bound (Theorem Y. Polyanskiy)
01:16:10 - Useful lemmas (Chernoff bound)
01:21:10 - Start with C_F
01:32:00 - Cntinue with C_M
01:32:56 - Fano's trick
01:41:06 - Proof sketch
01:50:20 - open question: is there a better region?
01:54:20 - Gordon's lemma
02:11:50 - Achievability bounds