Efficient encoding and decoding with permutation arrays

Te Tsung Lin*, Shi-Chun Tsai, Wen-Guey Tzeng

*此作品的通信作者

研究成果: Conference contribution同行評審

16 引文 斯高帕斯(Scopus)

摘要

An (n, d) permutation array (PA) is a subset of Sn with the property that the distance (under any distance metric, such as Hamming) between any two permutations in the array is at least d, which becomes popular recently for communication over power line. We use l∞-norm to measure the distance between permutations, and give a construction of permutation arrays under l∞-norm together with efficient encoding and decoding algorithms. This construction is the first of its kind.

原文English
主出版物標題Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
頁面211-214
頁數4
DOIs
出版狀態Published - 2008
事件2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada
持續時間: 6 7月 200811 7月 2008

出版系列

名字IEEE International Symposium on Information Theory - Proceedings
ISSN(列印)2157-8101

Conference

Conference2008 IEEE International Symposium on Information Theory, ISIT 2008
國家/地區Canada
城市Toronto, ON
期間6/07/0811/07/08

指紋

深入研究「Efficient encoding and decoding with permutation arrays」主題。共同形成了獨特的指紋。

引用此