Scribd
Upload
232 views

Encoding Circuit For (N, K) LBC

The document discusses linear block codes (LBC), their encoding and syndrome calculation circuits. It presents four theorems and corollaries about the error detection and correction capabilities of LBCs. Specifically, it states that an LBC's minimum distance equals the minimum hamming weight of a non-zero vector, and relates the minimum distance to the number of columns in the parity check matrix that can sum to zero. It concludes that an LBC with minimum distance dmin can detect up to dmin-1 errors and correct up to (dmin-1)/2 errors per code vector.

Uploaded by

Arun Upadhyaya
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
232 views

Encoding Circuit For (N, K) LBC

The document discusses linear block codes (LBC), their encoding and syndrome calculation circuits. It presents four theorems and corollaries about the error detection and correction capabilities of LBCs. Specifically, it states that an LBC's minimum distance equals the minimum hamming weight of a non-zero vector, and relates the minimum distance to the number of columns in the parity check matrix that can sum to zero. It concludes that an LBC with minimum distance dmin can detect up to dmin-1 errors and correct up to (dmin-1)/2 errors per code vector.

Uploaded by

Arun Upadhyaya
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 7

ENCODING CIRCUIT FOR (n,k) LBC

ENCODING CIRCUIT FOR (6,3) LBC

SYNDROME CALCULATION CIRCUIT

SYNDROME CALCULATION CIRCUIT FOR (6,3) LBC

ERROR DETECTION & CORRECTION CAPABILITY OF LBC THEOREM 1: The minimum distance of a LBC is equal to the minimum hamming weight of a non zero vector. THEOREM 2 (a):
Let C be a (n,k) LBC with parity check matrix H. For each code vector of Hamming weight l, there exist l column of H such that the vector sum of these columns is equal to the ZERO Vector.

THEOREM 2(b): converse of theorem 2 a. Let C be a (n,k) LBC with parity check matrix H. If there exist l column of H such that the vector sum of these columns is equal to the ZERO Vector, then there exist a code vector of hamming weight l in C. COROLLARY 2(c): let C be a LBC with parity check matrix H. If no (d-1) or fewer columns of H add to zero, the code has minimum Hamming weight of at least d.

COROLLARY 2(d): let C be a LBC with parity check matrix H. The minimum hamming weight (equal to Minimum distance) of C is equal to smallest number of columnns of H that add up to ZERO

THEOREM 3: A LBC with a minimum distance dmin can detect up to (dmin 1) errors in each code vector & can correct up to (dmin 1) /2 errors.

You might also like