Concept

Hamming bound

Related lectures (21)

Covers the theory of coset decoding and how to decode received messages.

Explores radiation-hard microelectronics design, rad-hard ASIC libraries, and mitigation techniques for single-event effects.

Error Correction Codes: Syndrome and Hamming Codes

Explains error correction codes, syndromes, Hamming codes, and error correction techniques.

Quantum Corrective Codes

Covers quantum corrective codes, error elimination, redundancy, classical coding, and parity matrices.

Error Correction Codes: Structure and Properties

Explores error correction codes, focusing on structure, properties, and the Singleton bound.

Error Correction

Covers error correction in quantum computing using Hamming codes and syndrome decoding.

Error Channel Guarantees: Singleton's Bound

Covers guarantees for MD decoding on an error channel, focusing on Singleton's Bound.

Ergodic properties of low complexity symbolic systems

Explores the influence of complexity on ergodic properties of symbolic systems, presenting the Curtis-Hedlund-Lyndon Theorem and constructions of minimal subshifts.

Soft-Output MIMO Detection

Explores the performance of soft-output linear detection in wireless communication systems and the complexity of MIMO detection algorithms.

Error Correction Codes: Hamming Code

Explores the Hamming Code for error correction, emphasizing its ability to correct single-bit errors.

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