Algorithm for computing term rank of binary matrices

We consider methods for correcting errors in the system of parallel channels with interference. The space of square matrices over a finite field is suggested. The term rank of the binary matrix A is defined to be a minimum number of rows and columns that contain all nonzero elements of the matrix. In this paper, we discuss the algorithm for computing the term rank of the matrix. Key words: term rank, lattice construction, finite field, binary matrices, distance of codes, row sum vector, column sum vector.