[R] Error Correcting Codes, Simplex

From: Egert, Bjoern <begert_at_ipb-halle.de>
Date: Sun 08 Oct 2006 - 12:34:29 GMT


  Is there a way in R to construct an (error correcting) binary code   e.g. for an source alphabet containing integers from 1 to say 255   with the property that each pair of distinct codewords of length m   is at Hamming distance exactly m/2 ?

  I was suggested to use so called simplex codes, which should be   fairly standard, but I haven't found a direct way via R packages   to do so, that's why I ask whether there might be in indirect way   to solve this problem.

  v1 =c(1,2,3,4)
  v2 =c(1,2,5,6)
  similarity(v1,v2)=0.5, (because 2 out of 4 elements are equal).   Obviously, a binary representation of would yield a different   similarity of:
  binary(v1) =001 010 011 100
  binary(v1) =001 010 101 110
  similarity(binary(v1),binary(v2))= 9/12

  Remark: The focus here is not on error correction, but rather the   binary encoding retaining similarity of the elements of vectors.

Many thanks,

        [[alternative HTML version deleted]]

R-help@stat.math.ethz.ch mailing list
https://stat.ethz.ch/mailman/listinfo/r-help PLEASE do read the posting guide http://www.R-project.org/posting-guide.html and provide commented, minimal, self-contained, reproducible code. Received on Sun Oct 08 22:40:52 2006

Archive maintained by Robert King, hosted by the discipline of statistics at the University of Newcastle, Australia.
Archive generated by hypermail 2.1.8, at Mon 16 Oct 2006 - 06:30:09 GMT.

Mailing list information is available at https://stat.ethz.ch/mailman/listinfo/r-help. Please read the posting guide before posting to the list.