home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.sys.amiga.hardware
- Path: sparky!uunet!cis.ohio-state.edu!zaphod.mps.ohio-state.edu!darwin.sura.net!sgiblab!munnari.oz.au!manuel.anu.edu.au!sserve!ajft_sun!ajft
- From: ajft@ajft_sun.cs.adfa.oz.au (Adrian Tritschler)
- Subject: Re: ECC Was: Re: Moving 500 to 1200, BAD NEWS
- Message-ID: <1992Nov17.060933.18436@sserve.cc.adfa.oz.au>
- Sender: ajft@ajft_sun (Adrian Tritschler)
- Organization: Australian Defence Force Academy
- References: <H0mXr*h41@dynam.adsp.sub.org> <1992Nov11.001328.10434@elroy.jpl.nasa.gov>
- Date: Tue, 17 Nov 1992 06:09:33 GMT
- Lines: 21
-
- In article <1992Nov11.001328.10434@elroy.jpl.nasa.gov>, ceg@bret.jpl.nasa.gov (Chuck Goodhart) writes:
- |> In article <H0mXr*h41@dynam.adsp.sub.org>
- |> cbmehq!cbmswi!dynam!jmpor@cbmvax.commodore.com writes:
- |> >with 10 bits you will be able to correct an 1 bit failure and detect a
- |> >2 bits failure.
- |>
- |> By my calculations, 12 bits are required for 1 bit correct, 2 bit detect
- |> on 8 data bits. 10 bits will only get you 6 data bits.
-
- Close, try 11, (8 + 3). The number of detection/correction bits is log (base 2)
- #databits. I don't believe it can be done in 10.
-
- See you local library re. Hamming Codes.
-
- |> Chuck Goodhart, ceg@bret.jpl.nasa.gov
-
- --
- // Adrian Tritschler // ajft@ajft_sun.cs.adfa.oz.au //
- ||\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\|| (06) 268 8166/\/\/\/\/\/\/\/\/\/\||
- || UAE: Uncontrollable African Elephants || Comp Sci Dept, ADFA ||
- \\ Chewing Segments, run for cover \\ Canberra, ACT, Australia \\
-