Search International and National Patent Collections

1. (WO2017041232) ENCODING AND DECODING FRAMEWORK FOR BINARY CYCLIC CODE

Pub. No.:    WO/2017/041232    International Application No.:    PCT/CN2015/089179
Publication Date: Fri Mar 17 00:59:59 CET 2017 International Filing Date: Wed Sep 09 01:59:59 CEST 2015
IPC: H03M 13/15
Applicants: GUANGDONG SUPER COMPUTING & DATA ASSURANCE TECHNOLOGY CO., LTD
广东超算数据安全技术有限公司
LI, Hui
李挥
Inventors: LI, Hui
李挥
HOU, Hanxu
侯韩旭
LI, Shuoyen Robert
李硕彦
SHUN, Kenneth W.
沈颖祺
CHEN, Jun
陈俊
Title: ENCODING AND DECODING FRAMEWORK FOR BINARY CYCLIC CODE
Abstract:
The present invention relates to the field of distributed storage systems. Disclosed is an encoding and decoding framework for a binary cyclic code, the framework consisting of a linear code and an alphabet. The linear code is a binary cyclic code, the binary cyclic code is an Rm-based linear code, and a binary parity-check code Cm is used as the alphabet, wherein Rm is a polynomial ring, a variable z represents a cyclic right shift operation of the ring Rm, and Cm consists of an even number of nonzero coefficient polynomials. In a binary-based finite field F2, the parity-check code Cm has a dimension of m-1, and Cm has a check polynomial of h(z):=1+z+…+zm-1. The present invention has the following beneficial effects: Because the encoding and decoding processes of the binary cyclic code both involve an exclusive-or operation only and have low computation complexity and small computation overheads, the present invention can greatly reduce the system computation delay, save time and resources, and reduce the costs, and is suitable for actual storage systems. The present invention provides necessary and sufficient conditions under which the binary cyclic code satisfies an MDS property, which is an important theoretical basis for designing an MDS code with low computation complexity.