How to find minimum distance in a genrator matrix?
Answers
Answered by
0
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 .However, it can be done much faster in general than generating all the codewords. I explain the .... As Gerry commented, you can easily find the minimum distance for particular ...
Similar questions