研究了线性分组码C[n ,k ,d]的网格图复杂度s和b及其相互关系 ,证明了有关可纠t个错的本原BCH码 [2 m - 1,2 m - 1- mt]及其扩展本原BCH码 [2 m,2 m - 1- mt]网格图的状态复杂度的若干结论 .从而避免了必须先寻找码的直和结构才可得到最小网格图的状态复杂度的较好上界 ,同时给出了线性分组码与其对偶码的分支复杂度之间的关系 . We study the complexity s and b of linear block codes C [n, k, d] and their relations, and prove that the original BCH codes [2 m - 1, 2 m - 1 - mt] and its extension of the original BCH code [2 m, 2 m - 1 mt] state complexity of the grid graph several conclusions.This avoids the need to find the first direct and code structure can get the minimum grid , The relationship between linear block codes and the branch complexity of its dual code is given.