ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

255 results

itechnica
10. Non Binary Huffman Codes
12:47
10. Non Binary Huffman Codes

21,570 views

8 years ago

nptelhrd
Mod-01 Lec-14 Non-Binary Huffman Code and Other Codes

Information Theory and Coding by Prof. S.N.Merchant, Department of Electrical Engineering, IIT Bombay. For more details on ...

48:26
Mod-01 Lec-14 Non-Binary Huffman Code and Other Codes

13,526 views

14 years ago

Tom Scott
How Computers Compress Text: Huffman Coding and Huffman Trees

Computers store text (or, at least, English text) as eight bits per character. There are plenty of more efficient ways that could work: ...

6:30
How Computers Compress Text: Huffman Coding and Huffman Trees

1,984,238 views

8 years ago

MIT OpenCourseWare
Lecture 17: Huffman Coding

MIT 18.200 Principles of Discrete Applied Mathematics, Spring 2024 Instructor: Ankur Moitra View the complete course: ...

1:17:59
Lecture 17: Huffman Coding

2,106 views

1 month ago

JentGent
these compression algorithms could halve our image file sizes (but we don't use them) #SoMEpi

an explanation of the source coding theorem, arithmetic coding, and asymmetric numeral systems this was my entry into #SoMEpi.

18:23
these compression algorithms could halve our image file sizes (but we don't use them) #SoMEpi

347,854 views

1 year ago

3Blue1Brown
But what are Hamming codes? The origin of error correction

A discovery-oriented introduction to error correction codes. Part 2: https://youtu.be/b3NxrZOu_CE Ben Eater:'s take: ...

20:05
But what are Hamming codes? The origin of error correction

2,818,424 views

5 years ago

Gate Smashers
L-4.3: Huffman Coding Algorithm in Hindi with Example | Greedy Techniques(Algorithm)

Huffman Coding is a technique of compressing data to reduce its size without losing any of the details. It was first developed by ...

12:30
L-4.3: Huffman Coding Algorithm in Hindi with Example | Greedy Techniques(Algorithm)

1,900,822 views

5 years ago

MIT OpenCourseWare
2. Compression: Huffman and LZW

MIT 6.02 Introduction to EECS II: Digital Communication Systems, Fall 2012 View the complete course: http://ocw.mit.edu/6-02F12 ...

49:53
2. Compression: Huffman and LZW

18,304 views

11 years ago

NPTEL IIT Bombay
Week 1-Lecture 6

Lecture 6 : Huffman Coding.

22:43
Week 1-Lecture 6

8,875 views

7 years ago

nptelhrd
Lecture - 26 Source Coding (Part - 1)

Lecture Series on Digital Communication by Prof.Bikash. Kumar. Dey , Department of Electrical Engineering,IIT Bombay. For more ...

54:06
Lecture - 26 Source Coding (Part - 1)

64,190 views

17 years ago

Simons Institute for the Theory of Computing
Coding for DNA-based Storage Systems

Olgica Milenkovic, University of Illinois, Urbana‑Champaign Coding: From Practice to Theory ...

36:13
Coding for DNA-based Storage Systems

3,047 views

10 years ago

Computerphile
EXTRA BITS/TRITS - Huffman Trees - Computerphile

More about Huffman trees and how they can even work for a trinary system. http://www.facebook.com/computerphile ...

5:38
EXTRA BITS/TRITS - Huffman Trees - Computerphile

57,627 views

12 years ago

nptelhrd
Mod-01 Lec-15 Adaptive Huffman Coding part-1

Information Theory and Coding by Prof. S.N.Merchant, Department of Electrical Engineering, IIT Bombay. For more details on ...

50:57
Mod-01 Lec-15 Adaptive Huffman Coding part-1

21,858 views

14 years ago

nptelhrd
Mod-01 Lec-11 Coding Strategies and Introduction to Huffman Coding

Information Theory and Coding by Prof. S.N.Merchant, Department of Electrical Engineering, IIT Bombay. For more details on ...

54:21
Mod-01 Lec-11 Coding Strategies and Introduction to Huffman Coding

10,750 views

14 years ago

Principles of Communication Systems: Part - II
Lec 47 | Principles of Communication-II |Huffman Code| IIT Kanpur

Want to learn Machine Learning, Quantum Computing with PYTHON? Check out our program!

33:48
Lec 47 | Principles of Communication-II |Huffman Code| IIT Kanpur

7,953 views

8 years ago

MIT OpenCourseWare
Lecture 16: Data Compression and Shannon’s Noiseless Coding Theorem

MIT 18.200 Principles of Discrete Applied Mathematics, Spring 2024 Instructor: Ankur Moitra View the complete course: ...

1:08:50
Lecture 16: Data Compression and Shannon’s Noiseless Coding Theorem

4,220 views

1 month ago

nptelhrd
Mod-01 Lec-12 Huffman Coding and Proof of Its Optimality

Information Theory and Coding by Prof. S.N.Merchant, Department of Electrical Engineering, IIT Bombay. For more details on ...

53:37
Mod-01 Lec-12 Huffman Coding and Proof of Its Optimality

13,185 views

14 years ago

Computerphile
Floating Point Numbers - Computerphile

Why can't floating point do money? It's a brilliant solution for speed of calculations in the computer, but how and why does moving ...

9:16
Floating Point Numbers - Computerphile

2,494,736 views

11 years ago

Tom Scott
How Binary Search Makes Computers Much, Much Faster

Featuring binary versus linear search, and non-clustered indexes. Uh, indices. However you want to say it. • MORE BASICS: ...

6:51
How Binary Search Makes Computers Much, Much Faster

1,537,710 views

5 years ago

Tom Scott
How To Read Text In Binary

http://tomscott.com - @tomscott - No, seriously. Here's how to read text when all you can see is a bunch of 0s and 1s. It's easier ...

3:29
How To Read Text In Binary

2,022,096 views

11 years ago