Generate Minimum distance codes

1. How do you find the minimum distance of code?
2. What should be the smallest minimum distance of a code?
3. What is the minimum distance of a single parity code?
4. What do we do to find minimum Hamming distance in a coding scheme?

How do you find the minimum distance of code?

The minimum distance, or minimum weight, of a linear block code is defined as the smallest positive number of nonzero entries in any n-tuple that is a codeword. wt = gfweight(genmat) returns the minimum distance of the linear block code whose generator matrix is genmat .

What should be the smallest minimum distance of a code?

To design a code that can detect d single bit errors, the minimum Hamming distance for the set of codewords must be d + 1 (or more). That way, no set of d errors in a single bit could turn one valid codeword into some other valid codeword.

What is the minimum distance of a single parity code?

These codes all have minimum distance 3, and hence can correct any single error.

What do we do to find minimum Hamming distance in a coding scheme?

To guarantee correction of up to t errors in all cases, the minimum Hamming distance in a block code must be dmin = 2t + 1.