切比雪夫距离下系统置换码的编译码算法

doi:10.3969/j.issn.1001-2400.2018.06.005

Abstract

Abstract: Since existing ［k+n,k,d］ systematic permutation codes which can correct limited-magnitude errors lack encoding and decoding procedures in the Chebyshev metric, an encoding algorithm for these systematic permutation codes is proposed by using the ranking and unranking mappings in the symmetric group and the interleaving technology of (n,M,d) permutation codes in the Chebyshev metric. Moreover, a decoding method of ［k+n,k,d］ systematic permutation codes is presented by using the the ranking and unranking mappings in the symmetric group and the projection technology for (n,M,d) permutation codes in the Chebyshev metric. The correctness of the proposed encoding and decoding methods for systematic permutation codes is illustrated by some calculation examples.

Key words: systematic permutation codes, Chebyshev metric, permutation codes , encoding, decoding, rank modulation

CLC Number:

TN911. 22

HAN Hui, MU Jianjun, JIAO Xiaopeng. Coding and decoding algorithms for systematic permutation codes at the Chebyshev distance[J].Journal of Xidian University, 2018, 45(6): 26-30+98.

References ［12］

［1］	JIANG A, MATEESCU R, SCHWARTZ M, et al. Rank Modulation for Flash Memories［J］. IEEE Transactions on Information Theory, 2009, 55(6): 2659-2673.<br />
［2］	BUZAGLO S, YAAKOBI E. On the Capacity of Constrained Permutation Codes for Rank Modulation［J］. IEEE Transactions on Information Theory, 2016, 62(4): 1649-1666.<br />
［3］	YEHEZKEALLY Y, SCHWARTZ M. Limited-magnitude Error-correcting Gray Codes for Rank Modulation［J］. IEEE Transactions on Information Theory, 2017, 63(9): 5774-5792.<br />
［4］	HOLROYD A E. Perfect Snake-in-the-box Codes for Rank Modulation［J］. IEEE Transactions on Information Theory, 2017, 63(1): 104-110.<br />
［5］	SCHWARTZ M, VONTOBEL P O. Improved Lower Bounds on the Size of Balls over Permutations with the Infinity Metric［J］. IEEE Transactions on Information Theory, 2017, 63(10): 6227-6239.<br />
［6］	KONG J, HAGIWARA M. Multipermutation Ulam Sphere Analysis toward Characterizing Maximal Code Size［C］//Proceedings of the 2017 IEEE International Symposium on Information Theory. Piscataway: IEEE, 2017: 1628-1632.<br />
［7］	JIANG A, SCHWARTZ M, BRUCK J. Correcting Charge-constrained Errors in the Rank-modulation Scheme［J］. IEEE Transactions on Information Theory, 2010, 56(5): 2112-2120.<br />
［8］	TAMO I, SCHWARTZ M. Correcting Limited-magnitude Errors in the Rank-modulation Scheme［J］. IEEE Transactions on Information Theory, 2010, 56(6): 2551-2560.<br />
［9］	ZHOU H, SCHWARTZ M, JIANG A, et al. Systematic Error-correcting Codes for Rank Modulation［J］. IEEE Transactions on Information Theory, 2015, 61(1): 17-32.<br />
［10］	FARNOUD F, SKACHEKV, MILENKOVIC O. Error-correction in Flash Memories via Codes in the Ulam Metric［J］. IEEE Transactions on Information Theory, 2013, 59(5): 3003-3020.<br />
［11］	LEHMER D H. Teaching Combinatorial Tricks to a Computer［C］//Proceedings of the 1960 Symposia in Applied Mathematics. Providence: AMS, 1960: 179-193.<br />
［12］	KLOVE T, LIN T T, TSAI S C, et al. Permutation Arrays under the Chebyshev Distance［J］. IEEE Transactions on Information Theory, 2010, 56(6): 2611-2617.<br />
	<div>
	<br />
	</div>

[1]	LI Runzhou,HUANG Qin. Additive Fourier transform encoding algorithm for binary quasi-cyclic codes [J]. Journal of Xidian University, 2020, 47(6): 21-29.
[2]	SU Jingrui,REN Guangliang,WANG Qiwei,XIN Jirong. ZigZag-IRSA random access scheme in IoT-oriented satellite networks [J]. Journal of Xidian University, 2020, 47(6): 50-57.
[3]	ZHOU Shenyang,BAI Baoming,REN Zhaofeng,ZHU Min,LI Binghao,TANG Ruibo. Study on belief propagation list decoding of concatenated polar codes with high throughput [J]. Journal of Xidian University, 2020, 47(6): 58-65.
[4]	ZHANG Meng,LI Zhuo,XING Lijuan. Weighted sum codes-aided SCL decoding of polar codes [J]. Journal of Xidian University, 2020, 47(6): 66-71.
[5]	ZHANG Yamei,ZHOU Lin,CHEN Chen,CHEN Qiwang,HE Yucheng. Sliding window decoding of the spatially coupled LDPC code Over Rayleigh fading channels [J]. Journal of Xidian University, 2020, 47(6): 78-83.
[6]	ZHANG Yamei,ZHOU Lin,CHEN Chen,GUO Rongxin,HE Yucheng. Sliding window decoding algorithm for spatially coupled LDPC codes with a variable window [J]. Journal of Xidian University, 2020, 47(3): 128-134.
[7]	GUO Junjun, BAI Shuodong, MU Jianjun, JING Xin, XIAO Feng. Efficient pseudo-codeword search algorithm for LDPC codes [J]. Journal of Xidian University, 2018, 45(6): 162-166.
[8]	WANG Biao;MU Jianjun;JIAO Xiaopeng;WANG Zhongfei. Method for early termination of ADMM penalized decoding for LDPC codes [J]. Journal of Xidian University, 2018, 45(5): 43-49.
[9]	ZHAO Peng;MU Jianjun;JIAO Xiaopeng. New construction methods for multipermutation codes under the Chebyshev distance metric [J]. Journal of Xidian University, 2018, 45(4): 51-56.
[10]	DAI Jingke;LIN Kailiang. Analysis and optimization of the LDPC code on the land mobile satellite channel [J]. Journal of Xidian University, 2018, 45(3): 52-57.
[11]	ZHANG Xuan;MU Jianjun;JIAO Xiaopeng. Bit-flipping decoding algorithm for the MLC flash memory [J]. Journal of Xidian University, 2017, 44(5): 75-80+146.
[12]	LI Guiping;MU Jianjun;JIAO Xiaopeng. Successive cancellation multibit-flipping decoding algorithm for polar codes [J]. Journal of Xidian University, 2017, 44(2): 63-68.
[13]	FAN Ya'nan;WANG Lichong;YAO Xiujuan;MENG Xin. Overlapped layered belief-propagation LDPC decoding algorithm [J]. Journal of Xidian University, 2017, 44(2): 88-94.
[14]	MU Jianjun;ZHAO Peng;JIAO Xiaopeng. Decoding of codes correcting a single translocation error for the cell's level of flash memory [J]. Journal of Xidian University, 2016, 43(6): 51-55+121.
[15]	WEI Xiaoran;GENG Guohua;ZHANG Yuhe. Connectivity compression of triangle meshes based on geometric parameter predict [J]. J4, 2015, 42(5): 194-199.

Coding and decoding algorithms for systematic permutation codes at the Chebyshev distance

PDF (PC)

Like

Knowledge

Abstract

Cite this article

share this article

References ［12］

Related Articles 15

Metrics

Comments

Recommended 10