YouTube Instagram TikTok How it works FAQ

The fastest way to turn talking videos into clean, searchable text. Free, private and no account required.

About

Built by Rishav Raj with one goal: free transcripts for everyone.

rishav@yttotranscript.com

Transcribe

YouTube to text
YouTube with timestamps
Instagram Reels
TikTok videos

Learn

How it works
FAQ
YouTube transcripts guide

More

Chrome extension
Contact
Privacy policy
Terms of service

© 2026 YTtoTranscript. Made for creators & researchers.

Not affiliated with YouTube, Instagram or TikTok. Respect creators’ copyright.

CSE320: Chapter -10 Block Coding — Transcript · YTtoTranscript

Home/Transcripts/YouTube

YouTube Transcript

CSE320: Chapter -10 Block Coding

Nowshin Tabassum · 987 words · 5 min read · EN

Watch on YouTube

Share X LinkedIn WhatsApp

Below is the complete, readable transcript of CSE320: Chapter -10 Block Coding by Nowshin Tabassum on YouTube. Read the full text, copy any part you need, or generate a transcript for any video with our free tool.

important important screen G Miss

um error detection and correction X second

chapter 10 error detection and

correction H6 no no sorry H2 link H2

and [Music]

[Music]

1 1 1 1 0 1

proc

can be corrupted during transmission

[Music] applications required that errors can be detected and corrected okay so let us first discuss some issues related toit

Transcribe another video

Paste any YouTube, Instagram or TikTok link to get a free transcript.

Free · No sign-up · Unlimitedor

Add to Chrome — transcribe in one click

[Music] 0 1 1 one one one one

[Applause]

okay

l l l

first of BS

0 1 01

inform

just to detect and correct the errors the central Concept in error detection and correction

rund bits are added by the sender and removed by the

receiver REM their presence help the receiver to detect and correct corrupts corrupted bits

correct errors we need to send

extra1 one

[Music]

1

1

disc

[Applause]

[Music]

BL

number of sequence of zer

4B block coding scheme number

1 [Music] 1 number

citable

we divide our Mage into BL

dat then we add R redundant bits to each block to make the length n equal to K plus r

1 [Music]

okay Oneal

r + K which is r value one k value 3al to 4

by 4 blocking okaying

yes

ma'am uh can

Me 0 0 1 1 1

1 Comal

0 0 1 1

1 right

2 that means 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1

1

important each of n Bits only 2 K of

Val invid invalid Val okay

okay 2

3 like to much

actually

um 011 1 one one

right 1 [Music] 1 1

0 Z One Z 1 Z One 1 1 1 1 01 1 1 1 0 0

un

1 sorry 1 1 1

one

invalid

[Music]

1 valid Cod

in

can

[Applause] okay e

[Applause]

1

second 1 Z 1 1up

[Applause]

of

Val 011

one1 one1 valid

[Music] okay

incorrect main incre incre just BL incorrect yes

distance

z0 1 dat data word data

one1 0 0 0 1 0 0 1 0 0 1

[Applause] one haming haming haming

[Applause] [Applause]

1

between two words is the number of differences between corresponding bits change

dist

exing of two single bits or two

words same Z different

two bits are same the result is zero two bits are different result is one different one

one different one one one same z0 one different so one one one same Z same

[Applause]

h

[Music] 01 ex one one one exor Z 1 Z

[Music]

h haming distance yes

ma'am

mean 0 second 1 1

two a distance

Hing one one Z one that means one

1

Z sorry 0 0 0 1 1 0 1 1 Z [Music]

okay one1

distance ex a CH one a CH one

a there are four different code words and which can have six possible pairs okay so a

h

[Applause] [Music]

Val Z One inv word right because Okay so

because 0 1 one one sorry 1 Z

One minimum Hing

2 3

[Music] 4im minimum Hing distance

us

0

right error detected

one

one combin 0 0 1 1 0

Val

[Music]

0 1 01 1

second because

soit

for okay

uh beit number of [Music] bits number of error error beats detected D mean minus one minimum Hamming distance

one11

one one one one one one

0 1 1 0 0 1 1

maximum number of error bits can be detected Maxim

Maxim

number minimum four four minus 3 four minus sorry one0

number

one

[Applause]

[Music] one

so that's why

okay

yes Ma

to guarantee the detection of after

number okay

number s

just one b

5

sorry for

okay one ion um

change one bit okay

second 0 1

1 0 0 1 one1

right because

Hing distance five Hing distance five code words code words

Hing haming distance five okay the minimum Hamming distance D mean d mean

oneus

one for

D mean minus one / by 2 5 5 - 1 iD 2 that means 4 - 1 / 2 which is 2 by uh sorry

[Applause]

okay 2 2T is = to dmin minus one so d 2 okay

examp

[Music]

comus one

01011

[Applause]

0 1

com

[Music] [Applause]

[Music]

Z 1

[Music] one zero

[Music]

1 1 1 1

distance 0 1 01 valid code word last one 1 Z right

minim that

me dist one one ch right just a that

D mean minus one that means 3 minus one which is

minus one divid 2 3 1 2 2 by 2 which is one ch

min

01 1 1 0 1 011 01

[Music]

Ma

1 1

because

becauseas

can zero one can one one

hello because [Applause] dist

[Music] dark red dark blue okay dark dark blue mix

light blue

[Applause]

obviously

ma'

cap

okay because correction capability maximum one bit change okay

okay

okay detction and correction capability of Thee

[Applause] capability two four D mean minus1 / 2 which is 4 - 1 ided 2 that means 3x 2 which is 1.5 then Frac 1.5

it can correct up to one error okay in other words in this Cod it is used for error correction part of its capabilities wasted error correction to

be okay

um second

okay

simp

yes

ma'am crcc redund Che

x to the power a a z a z x to power 6 A1 X power 5 po because

complicated important for

one mage

proc dat

s

re

firstus last K minus one Z

[Music] okay nus

okayed data word augment

Okay so divus

zero different different one

for for

that

me1 exact but

Z and one different one Z or Z same Z one one

1 1 one1 by [Applause]

Miss

okay for

Z

second for

okay yes

ma'am complicated a

pleas

[Music]

onl on

because

so