Content deleted Content added
m made a few corrections in the definition |
|||
Line 5:
== Definition and Properties ==
A permutation code <math>C</math> is defined as a subset of the [[Symmetric group|Symmetric Group]] in <math>S_n</math> endowed with the usual [[Hamming distance]] between strings of length <math>n</math>. More precisely, if <math>\sigma, \tau</math> are
d(\tau, \sigma) = |\left \{ i \in \{1, 2, ..., n\} : \sigma(i) \neq \tau(i) \right \}|</math>
The minimum distance of a permutation code is defined to be the minimum positive integer <math>d_{min}</math> such that there exist <math>\sigma, \tau</math> <math>\in</math> <math>C</math>, distinct, such that <math>d(\sigma, \tau) = d_{min} </math>.
One of the reasons why permutation codes are suitable for certain channels is that alphabet symbols only appear once in each codeword, which for example makes the errors occurring in the context of [[Power-line communication|powerline]] communication less impactful on codewords
| |||