中意绿色能源试验室建设事宜.pptVIP

* For the researches on Reed Muller codes, see Yanling Chen’s paper (2010 IT). Maybe LDPC … in the future ? * To deal with the big problem, we consider cyclic code and cyclic subcode. GOOD NEWS: For general linear code, the corresponding problem is not easy since few algebraic structures are left in its subcodes. But for cyclic codes and subcodes, it looks OK * GOOD NEWS: For general fixed linear code, the lengths of all the distance profiles are the same as the rank of the code. For cyclic subcode chain, the lengths of the distance profiles are also the same. * GOOD NEWS: For general fixe