Abstract
Binary sequences which have no fewer than 'd' and no more than 'k' zeros between neighboring ones are called (d,k) codes. They are used in many recording systems to improve the density of information storage and to provide self timing. Here we investigate a number of properties of such sequences. A new derivation of the capacity of these sequences is presented. By a slight modification of the derivation we obtain upper and lower bounds to the capacity which are easy to evaluate. A simple method of obtaining (O,k) codes is given. Finally, a generating function approach is described for enumerating (d,k) sequences having certain properties.
| Original language | English |
|---|---|
| Pages | 359-361 |
| Number of pages | 3 |
| State | Published - 1986 |
| Externally published | Yes |