Difference-preserving codes
Open Access
- 1 September 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 20 (5) , 643-649
- https://doi.org/10.1109/tit.1974.1055267
Abstract
A code of integers into binary sequences is called a difference-preserving code (DP code) if it has the following two properties: 1) if the absolute value of the difference between two integers is less than or equal to a certain threshold, the Hamming distance between their codewords is equal to this value and 2) if the absolute value of the difference between two integers exceeds the threshold, then the Hamming distance between their codewords also exceeds this threshold. Such codes (or slight modifications thereof) have also been called path codes, circuit codes, or snake-in-the-box codes. This paper discusses the application of DP codes to pattern recognition and classification problems and presents a construction of efficient DP codes whose information content is asymptotically (in the length of codewords) of the order of theoretical upper bounds.Keywords
This publication has 9 references indexed in Scilit:
- Note on Circuits and Chains of Spread k in the n-CubeIEEE Transactions on Computers, 1971
- What is the Maximum Length of a d-Dimensional Snake?The American Mathematical Monthly, 1970
- Upper bounds on the length of circuits of even spread in the d-cubeJournal of Combinatorial Theory, 1969
- Some results on the maximum length of circuits of spread k in the d-cubeJournal of Combinatorial Theory, 1969
- A Method for Constructing Circuit CodesJournal of the ACM, 1967
- Lengths of snakes in boxesJournal of Combinatorial Theory, 1967
- Generalized Snake-in-the-Box CodesIEEE Transactions on Electronic Computers, 1966
- Longest ``Separated'' Paths and Loops in an N CubeIEEE Transactions on Electronic Computers, 1965
- Unit-Distance Error-Checking CodesIEEE Transactions on Electronic Computers, 1958