Worst case code patterns for magnetic buried servos
Siegel, P.; Marcus, B.
Magnetics, IEEE Transactions on
Volume 20, Issue 5, Sep 1984 Page(s): 906 - 908
Digital Object Identifier  
Summary: A technique for determining worst case run-length-limited (RLL) code patterns for data-to-servo coupling in magnetic buried servos is presented. The problem is reduced to a general dynamic programming problem, whose solution is described. The general problem can require large amounts of computation, so a method is also developed to determine approximate worst case patterns by solving a classical dynamic programming problem using the Viterbi algorithm. An error estimate for the approximate solution is also derived. Computational results are presented for the

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.