Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Concept
Hamming bound
Applied sciences
Information engineering
Information theory
Coding theory
Graph Chatbot
Related lectures (21)
Login to filter by course
Login to filter by course
Reset
Previous
Page 2 of 3
Next
Source Coding: Compression
Covers entropy, source coding, encoding maps, decodability, prefix-free codes, and Kraft-McMillan's inequality.
Quantum Correction Codes 2
Explores quantum error correction codes, including Hamming codes and repetition codes, noisy quantum coding, and single error correction.
Low Complexity MIMO ML Receivers
Explores MIMO spatial multiplexing, ML detection, receivers with fading, tree representation, and sphere decoding.
Untitled
Interlacing Families and Ramanujan Graphs
Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.
Channel Coding and BICM (LLRs)
Explores channel coding, BICM, and LLRs in wireless communication systems, emphasizing the importance of error detection and correction.
Sparsest Cut: ARV Theorem
Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.
Linear Maps and the Duality Principle in Mathematics
Covers the duality principle in linear algebra and its implications in mathematics.
Quantum Error Correction: Knill-Laflamme Theorem
Explores the Knill-Laflamme theorem in quantum error correction and its importance in quantum computing.
Untitled
