> >Read: MFM uses two disk bits for each data bit. > >See http://www.cs.tut.fi/~albert/Dev/ -> C1581 > > Isn't that inefficient compared to GCR (five disk bits for four data bits)? > Or is it more complex than that? Yes and no. With MFM you never have two consequtive 1-bits and thus you can pack the bits closer together. -Pasi -- "So, what's the occasion?" "Who says there has to be an occasion to invite you to join us for dinner?" "I didn't get to be a head of security for my good looks." -- Garibaldi and Sakai in Babylon 5:"Chrysalis" - This message was sent through the cbm-hackers mailing list. To unsubscribe: echo unsubscribe | mail email@example.com.
Archive generated by hypermail 2.1.1.