A new family of optimal codes correcting term rank errors

We consider messages represented as matrices. The term rank norm of a matrix is defined as minimal number of lines (rows and columns) which cover all the non zero entries of a matrix. We propose a family of codes correcting term rank errors. These codes are optimal since they reach the Singleton-type bound.