Class of Correcting Codes for Errors With a Lattice Configuration

The article describes a quasioptimal class of codes for correcting errors of lattice configuration over parallel channels; codes consisting of rectangular matrices, in a special rank metric, are considered. Asymptotically precise limits for code rates are obtained. For square matrices of order n, codes with codes distance 2, 3, 4, $n$ are constructed, as well as codes which will detect bursts of lattice errors.