Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Block code

Related lectures (24)

Kraft-McMillan Theorem

Explores the Kraft-McMillan theorem, proving the existence of uniquely decodable prefix-free codes.

Source Coding: Compression

Covers entropy, source coding, encoding maps, decodability, prefix-free codes, and Kraft-McMillan's inequality.

Linear Codes: Systematic vs Non-Systematic

Explores the creation of systematic linear codes and the transformation of non-systematic codes, showcasing their equivalence and importance in simplifying encoding and decoding processes.

Error Correction Codes: Syndrome and Hamming Codes

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

Linear Block Codes: Basics

Covers the basics of linear block codes and systematic codes over a field F.

Encode Your Avatar in a List

Covers the process of encoding an avatar in a list using blocks.

Control the cat

Explains how to control a cat using coding blocks to make it move, speak, and repeat actions.

Introduction to Scratch Interface

Covers the basics of the Scratch interface for creating projects with sprites and coding blocks.

Coset Decoding: Theory and Examples

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

Data Compression and Shannon's Theorem: Entropy Calculation Example

Demonstrates the calculation of entropy for a specific example, resulting in an entropy value of 2.69.

Error-Correcting Codes: Reed-Solomon

Explains Reed-Solomon error-correcting codes and their unique decoding property over finite fields.

Shannon-Fano Codes

Covers Shannon-Fano codes, a method for uniquely decodable and prefix-free coding, and discusses their optimality compared to the entropy.

Source Coding and Prefix-Free Codes

Covers source coding, injective codes, prefix-free codes, and Kraft's inequality.

Stochastic Processes: Sequences and Compression

Explores compression in stochastic processes through injective codes and prefix-free codes.

Linear Codes: Dimension and Hamming Weight

Discusses linear codes' dimension and Hamming weight with examples and theorems.

Compression: Strong Connection and Prefix-Free Codes

Explores the relationship between code word length and probability distribution, focusing on designing prefix-free codes for efficient compression.

Radiation Hard Microelectronics

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

Information Theory: Source Coding, Cryptography, Channel Coding

Covers source coding, cryptography, and channel coding in communication systems, exploring entropy, codes, error channels, and future related courses.

Error Channel Guarantees: Singleton's Bound

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

Quantum Corrective Codes Log in to Mediaspace to watch this video

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