Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watnot!watmath!dalcs!thompson
From: thompson@dalcs.UUCP
Newsgroups: comp.misc
Subject: Tape testing.
Message-ID: <2453@dalcs.UUCP>
Date: Tue, 17-Mar-87 12:49:54 EST
Article-I.D.: dalcs.2453
Posted: Tue Mar 17 12:49:54 1987
Date-Received: Wed, 18-Mar-87 01:48:19 EST
Reply-To: thompson@dalcs.UUCP (Michael A. Thompson)
Distribution: world
Organization: Dept. of Math., Stats & C.S., Dalhousie University, Halifax, N.S., Canada
Lines: 19


	I am planing on writing a tape-testing program, this is a
    program, that would write one of several bit-patterns on to tape
    for it's entire length and then (optionally) rewind and reread.
    Our tape drive automatically reads what it has written and
    rewrites it if necessary. The program would also print an guess
    of the amount of tape written before the end-of-tape.

	Now what I would like to have are suggestions for bit patterns
    to use, I am looking for bit patterns that are more likely to
    generate a hard error in the case of a bad tape, also any
    references to literature on determining such bit patterns.

				Thanx in advance
-- 
Michael A. Thompson, Dept. Math, Stats, & C.S., Dalhousie U., Halifax, N.S.
thompson@dalcs.uucp	From Bitnet or Uucp
thompson@cs.dal.cdn	From Bitnet or Cdn
thompson%dalcs.uucp@seismo.arpa From Arpa