Distance-preserving mappings and trellis codes with permutation sequences
Our research is focused on mapping binary sequences to permutation sequences. It is established that an upper bound on the sum of the Hamming distance for all mappings exists, and this sum is used as a criterion to ascertain how good previously known mappings are. We further make use of permutation...
| Main Author: | |
|---|---|
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10210/744 |