Abstract: The present application discloses a method and apparatus for generating an optimal H matrix. The method includes steps of: constructing an n*n fundamental matrix according to a preset constraint condition; performing a cyclic shift by taking each row vector of the fundamental matrix as a unit to generate (n?1) expansive matrixes; and generating a target H matrix according to the fundamental matrix and the expansive matrixes. Due to the implementation of the present application, an optimal H matrix is constructed by taking the thought of lowering the space complexity of an H matrix and reducing the hardware cost into consideration on the premise that a single-error-correcting and double-error-detecting function of a Hamming code is not affected; and a cyclic shift method is provided in combination with properties of the optimal H matrix, and a required target optimal H matrix may be formed by regularly expanding the constructed fundamental matrix.