Understanding Block Coding || Lesson 10 || Computer Networks || Learning Monkey ||

Here we will have Understanding Block Coding.
In block coding, we divide our message into blocks, each of k bits, called data words. We
add r redundant bits to each block to make the length n = k + r. The resulting n-bit blocks
are called codewords. How the extra r bits are chosen or calculated is something we will
discuss later. For the moment, it is important to know that we have a set of data words,
each of size k, and a set of codewords, each of size of n. With k bits, we can create a combination
of 2k data words; with n bits, we can create a combination of 2n codewords.
Since n k, the number of possible codewords is larger than the number of possible data words.
The block coding process is one-to-one; the same data word is always encoded as
the same codeword. This means that we have 2n - 2k codewords that are not used.

Link for playlists:

[universalponcho]

This was very informative for a subject that no one wants to talk about on YouTube haha

[avantikasgoodlife]

it was very useful, thanks sir for make us understand in English

[prashanthb]

Algorithm generating bits to ensure even parity in code words

[sajahikmat]

Thank you very much, its very helpful

[backpro]

Good explanation but also use hindi in explaining ❤

[pushkarmatli]

Does block coding use the concept of even parity?