# 2-4-2-1 code

No description. (Wikipedia).

Decimal to BCD

From playlist Number Systems

Ex 2: Number Problem: Find a Number given a Relationship

This video explains how to find a number given the difference of a number and 1/4 of the number is 192. Complete Video Library: http://www.mathispower4u.com Search Videos: http://www.mathispower4u.wordpress.com

Differentiate y = 18 - 3sin(4x)

Please Subscribe here, thank you!!! https://goo.gl/JQ8Nys Differentiate y = 18 - 3sin(4x)

From playlist Calculus

Ex 1: Apply Divisibility Rules to a 4 Digit Number

This video explains how to apply the divisibility rules for 2, 3, 4, 5, 6, 8, 9, and 10. http://mathispower4u.com

From playlist Factors, Prime Factors, and Least Common Factors

How To Add and Subtract Binary Numbers

This video explains how to add and subtract binary numbers. The full version of this video contains extra examples of subtracting, multiplying, and dividing binary numbers. Full 43 Minute Video: https://www.youtube.com/watch?v=eAdWDu3s8xM

From playlist Number Systems

18 = 2 - 3x

In this video, we solve for x.

From playlist Algebra 1 Test 2

Algebra 2 4.4d - Complex Numbers, Part 4 - Mathematical Operations

Addition, subtraction, and multiplication of complex numbers.

From playlist Algebra 2 - Complex Numbers

Algebra 2 - When Complex numbers are equal to each other, 5x + 1 + (3 + 2y)i = 2x - 2 + (y - 6)i

http://www.freemathvideos.com presents Intro into complex numbers. In this video playlist I will explain where imaginary and complex numbers come from and how we can use them to help us solve problems. We will also explore the complex property of equality to solve for values of complex nu

From playlist Complex Numbers

Lec 25 | MIT 6.451 Principles of Digital Communication II

Linear Gaussian Channels View the complete course: http://ocw.mit.edu/6-451S05 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

From playlist MIT 6.451 Principles of Digital Communication II

Lec 17 | MIT 6.451 Principles of Digital Communication II

Codes on Graphs View the complete course: http://ocw.mit.edu/6-451S05 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

From playlist MIT 6.451 Principles of Digital Communication II

MATH3411 Problem 27

MATH3411 Information, Codes and Ciphers In this problem, we are asked to construct instantaneous codes with given radix and codeword lengths if these codes exist - or to prove that they do not exist, for instance by using the Kraft-McMillan Theorem. Presented by Thomas Britz, School of M

From playlist MATH3411 Information, Codes and Ciphers

What is Special About the Number 4?

This video explains what is special about the number 4 and the spelling of 4.

From playlist Mathematics General Interest

(IC 2.7) Expected codeword length

Definition of expected codeword length of a symbol code, and examples. A playlist of these videos is available at: http://www.youtube.com/playlist?list=PLE125425EC837021F

From playlist Information theory and Coding

Everything You Need to Know About JPEG - Episode 4 Part 1: Huffman Decoding

In this series you will learn all of the in-depth details of the complex and sophisticated JPEG image compression format In this episode, we learn all about Huffman codes, how to create a Huffman Coding Tree, and how to create Huffman codes based on a JPEG Huffman Table Jump into the pla

From playlist Fourier

Lec 20 | MIT 6.451 Principles of Digital Communication II, Spring 2005

The Sum-Product Algorithm View the complete course: http://ocw.mit.edu/6-451S05 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

From playlist MIT 6.451 Principles of Digital Communication II

Lec 6 | MIT 6.451 Principles of Digital Communication II

Introduction to Binary Block Codes View the complete course: http://ocw.mit.edu/6-451S05 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

From playlist MIT 6.451 Principles of Digital Communication II

(IC 2.10) Kraft-McMillan - examples for (b)

For a given set of lengths, the Kraft-McMillan inequality is a necessary condition for the existence of a uniquely decodable code, and a sufficient condition for the existence of a prefix code. A playlist of these videos is available at: http://www.youtube.com/playlist?list=PLE125425EC83

From playlist Information theory and Coding

Lec 4 | MIT 6.451 Principles of Digital Communication II

Hard-decision and Soft-decision Decoding View the complete course: http://ocw.mit.edu/6-451S05 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

From playlist MIT 6.451 Principles of Digital Communication II

Codewords From Generating Matrix

In this video I describe how to get your codewords from your generative matrix. MISTAKE: I put 4^2, rather than 2^4. In my case both =16 so it didn't change the rest of the problem. But the reasoning is still the same: we have a binary code (2) and a length of 4... so we should calculate

From playlist Cryptography and Coding Theory

Binary to Octal Conversion