On the complexity of constructing Golomb Rulers
Discrete Applied Mathematics
Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design
Information Processing Letters
A Tabu Search algorithm for difference triangle sets and Golomb rulers
Computers and Operations Research
European Journal of Combinatorics
The complexity of minimum difference cover
Journal of Discrete Algorithms
Hi-index | 754.84 |
A class of binary recurrent codes for correcting independent errors is given which has guaranteed error-limiting properties. These codes can be simply decoded using threshold decoding, and will recover from any decoding error caused by either an uncorrectable transmission error or a temporary malfunction of the encoder or decoder. A number of such codes are given along with a synthesis procedure. The results of a computer simulation are given which indicate that these codes perform better in some situations than other codes using threshold decoding.