Construction of Certain Cyclic Distance-Preserving Codes Having Linear-Algebraic Characteristics |
| |
| Authors: | A. J. van Zanten Agung Lukito |
| |
| Affiliation: | (1) Faculty of Technical Mathematics and Informatics, Delft University of Technology, P.O. Box 5031, 2600 GA DELFT, The Netherlands |
| |
| Abstract: | An ordered list of binary words of length n is called a distance-preserving  m, n -code, if the list distance between two words is equal to their Hamming distance, for distances up to m. A technique for constructing cyclic m, n-codes is presented, based on the standard Gray code and on some simple tools from linear algebra. |
| |
| Keywords: | cyclic distance-preserving codes cyclic difference-preserving codes circuit codes Gray code |
| 本文献已被 SpringerLink 等数据库收录！ |
|
