On the channel capacity of read/write isolated memory
Discrete Applied Mathematics
Coding Techniques for Digital Recorders
Coding Techniques for Digital Recorders
New upper and lower bounds on the channel capacity of read/write isolated memory
Discrete Applied Mathematics
Constrained coding for binary channels with high intersymbol interference
IEEE Transactions on Information Theory
On codes that avoid specified differences
IEEE Transactions on Information Theory
Writing sequences on the plane
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The error probability of certain magnetic recording systems can be characterized by the difference patterns between the sequences that may be recorded. In [9] it is shown that the number of these sequences increases exponentially with their length and the capacity, the maximum growth rate of such sequences, is proven to be the logarithm of the joint spectral radius of a set of certain (0, 1) matrces. But approximating the joint spectral radius of a set of (0, 1) matrices is known to be NP-hard [11] (This is also stated in [9]).In this correspondence, we study these sequences using binary tree. Compared with the previous work, we get around the computation of the joint spectral radius. The number of sequences that avoid a certain set of difference patterns is proven to satisfy linear recurrence relations. From this we characterize the codes that have the maximum/minimum capacities. Our computation of capacities is straight-forward and therefore has less complexity than the previous ones.