On DC free magnetic recording codes generated by finite state machines

H.C. Ferreira

IEEE Transactions on Magnetics · 1983 · 14 citations · 4 references

Concepts

Abstract

State systems for the encoding of the following magnetic recording codes, with minimum Hamming distance d <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">min</inf> , as indicated, are presented. A R = ½, (1, 4, 3), d <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">min</inf> = 2 code; a R = ½, (0, 3, 3), d <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">min</inf> = 4 code; and a R = 2/4, (0, 3, 2), d <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">min</inf> = 4 code. An encoder and decoder for the (1, 4, 3) code are shown. Minimum Hamming distance aspects of dc free codes, generated by finite state machines, are briefly discussed.

References

4