The majority-logic decoding for cyclic codes

순환성 코드를 사용한 Majority logic 디코딩

In this paper, the (15,7) cylic codesused EG(2,2) were decoded by one step majority logic decoding. This decoding algorithm is based on the properties of finite geometries and can be simply implemented for moderate length n. especially one step majority logic decoding is attractive because the complexity and the cost of the majority logic decoder increase very rapidly with L, the number of decoding steps. The theorectical and experimental results show that the majority logic decoding presented in this paper is a relatively effective decoding scheme.