Efficient decoding of permutation codes obtained from distance preserving maps
We study the decoding of permutation codes obtained from distance preserving maps and distance increasing maps from Hamming space. We provide efficient algorithms for estimating the q-ary digits of the Hamming space so that decoding can be performed in the Hamming space.
Saved in:
| Main Authors: | , |
|---|---|
| 其他作者: | |
| 格式: | Conference or Workshop Item |
| 語言: | English |
| 出版: |
2013
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/102593 http://hdl.handle.net/10220/16392 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |