Theory of codes with rank: distance was introduced in 1985, which can be applied to crisscross error correction and also used to build some cryptographical schemes. In this paper, we propose a new identification algorithm based on rank distance codes. This algorithm is simple to describe, it has also advantages in both communications and memory bits.
原文链接
分享
引用
