Abstract: Under certain mild conditions, the minimum Hamming distance D of an (N, K, D) group code C over a non-abelian group G is bounded by D N/2. Consequently, there exists no (N, K, N-K+1) group ...
Abstract: In this study, a new window obtained by the combination of two windows, known as Kaiser and Hamming, is proposed for the design of nonrecursive digital filters. First, the proposed window is ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback