Constructing Large Families of Pairwise Far Permutations: Good Permutation Codes Based on the Shuffle-Exchange Network
暂无分享,去创建一个
[1] V. Benes. Optimal rearrangeable multistage connecting networks , 1964 .
[2] Yeow Meng Chee,et al. Efficient decoding of permutation codes obtained from distance preserving maps , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[3] Leslie G. Valiant,et al. Universal schemes for parallel communication , 1981, STOC '81.
[4] Leslie G. Valiant,et al. A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..
[5] Derek H. Smith,et al. Decoding mixed errors and erasures in permutation codes , 2015, Des. Codes Cryptogr..
[6] Avi Wigderson,et al. Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing , 2020, Electron. Colloquium Comput. Complex..
[7] D. Slepian. Permutation Modulation , 1965, Encyclopedia of Wireless Networks.
[8] Peter J. Cameron,et al. Permutation codes , 2010, Eur. J. Comb..
[9] Charles J. Colbourn,et al. On constant composition codes , 2006, Discret. Appl. Math..