并元加性群的陪集劃分與RM碼的小數(shù)邏輯譯碼算法
COSET PARTITION OF DYADIC ADDITIVE GROUPS AND MINORITY-LOGIC DECODING ALGORITHM FOR RM CODES
-
摘要: 本文首次提出了并元加性群陪集劃分中的兩個(gè)新概念,給出了它們的充分必要條件,并給予證明。籍此解決了對(duì)RM碼實(shí)施的小數(shù)邏輯譯碼算法的可行性問(wèn)題。
-
關(guān)鍵詞:
- 并元群; 陪集; 編碼; 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. -
劉玉君,電子學(xué)報(bào),17(1989)1,14-19.[2]胡正名,電子學(xué)報(bào),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. -
計(jì)量
- 文章訪問(wèn)數(shù): 2278
- HTML全文瀏覽量: 97
- PDF下載量: 418
- 被引次數(shù): 0