并元加性群的陪集划分与RM码的小数逻辑译码算法
COSET PARTITION OF DYADIC ADDITIVE GROUPS AND MINORITY-LOGIC DECODING ALGORITHM FOR RM CODES
-
摘要: 本文首次提出了并元加性群陪集划分中的两个新概念,给出了它们的充分必要条件,并给予证明。籍此解决了对RM码实施的小数逻辑译码算法的可行性问题。
-
关键词:
- 并元群; 陪集; 编码; RM码
Abstract: Two new notions for coset partition of the dyadic additive goups are proposed, and their sufficient and necessary cond itions are also given. On the basis of these works, the feasibility problem of implementing minority-logic decoding algorithm for RM codes is solved. -
刘玉君,电子学报,17(1989)1,14-19.[2]胡正名,电子学报,8(1980)1,69-78.[3]F. J. Macwiliiams, N. J[4]A. Sloane, The Theory of Error-Correcting Codes North-Holland, Amsterdam,(1977), pp.370-405. -
计量
- 文章访问数: 2237
- HTML全文浏览量: 86
- PDF下载量: 415
- 被引次数: 0
下载:
