Efficient Decoding Of Permutation Codes Obtained From Distance Preserving Maps

2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT)（2012）

引用 8|浏览8

暂无评分

摘要

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.

查看译文

关键词

Permutation codes, Distance preserving maps

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要