Conference paper
Authors list: Chen, KF
Editor list: Dawson, E; Golic, J
Publication year: 1996
Pages: 244-249
Journal: Lecture notes in computer science
Volume number: 1029
ISSN: 0302-9743
ISBN: 3-540-60759-5
Conference: International Conference on Cryptography - Policy and Algorithms
Publisher: Springer
Title of series: Lecture Notes in Computer Science
Abstract:
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.
Citation Styles
Harvard Citation style: Chen, K. (1996) A new identification algorithm, Lecture notes in computer science (Schriftenreihe), 1029, pp. 244-249
APA Citation style: Chen, K. (1996). A new identification algorithm. Lecture notes in computer science (Schriftenreihe). 1029, 244-249.
