Optimal and suboptimal structured algorithms of binary linear block codes ABSTRACT:The optimal and suboptimal structured algorithms of linear block codes from the geometrical perspective are represented. The minimum distance and weight property lemmas and the theorem are proved for the generator matrix. Based upon the property of generator matrix, the structured algorithms of linear block codes are demonstrated. Since the complexity of optimal structured algorithm is very high, the binary linear block codes is searched by using the suboptimal structured algorithm. The comparison with Bose-Chaudhuri-Hocquenqhem (BCH) codes shows that the searched linear block codes are equivalent on minimum distance and can be designed for more block lengths. Because the linear block codes are used widely in Communication systems and digital applications, the optimal and suboptimal structured algorithms must have great future being widely used in many applications and perspectives. Did you like this research project? To get this research project Guidelines, Training and Code... Click Here facebook twitter google+ linkedin stumble pinterest Improved delay-dependent stability criteria for systems with interval delay Information gain based sensor search scheduling for low-earth orbit constellation estimation
