On ternary error correcting line codes

The authors present Markov diagrams and tables with the capacities in bits/symbol for input restricted ternary channels with various restrictions on maximum runlengths, digital sum variation, and transitions between extreme signal levels. They derive Gilbert-type lower bounds on the minimum Hamming and Euclidean distances achievable with ternary line codes of rates lower than the capacity of the corresponding input restricted channel. They present some single-symbol-error-correcting ternary line codes, found by computer search methods.<
>