摘要
Two new notions for the coset partition of dyadic additive groups are proposed,andtheir sufficient and necessary conditions are also given.On the basis of these works,the feasibilityproblem of implementing minority-logic decoding algorithm for RM codes is solved.
Two new notions for the coset partition of dyadic additive groups are proposed,and their sufficient and necessary conditions are also given.On the basis of these works,the feasibility problem of implementing minority-logic decoding algorithm for RM codes is solved.
