纠正稳定和非稳定突发擦除错误的置换码

doi:10.19665/j.issn1001-2400.2021.03.006

Abstract

Abstract:

In order to improve the reliability of flash memories,permutation is used to represent the rank modulation scheme of the flash cell charge.Error-correcting codes based on permutation groups can correct a variety of special error types that are caused by the rank modulation scheme.When a flash memory cell is damaged and the stored charge value cannot be read correctly,an erase error or a delete error may occur in the corresponding position.Aiming at the problem of the stability of burst erasure errors in rank modulation of the flash memory,a new construction of permutation codes combined with the permutation interleaving technique is proposed by the existing Levenshtein permutation code that can correct a single deletion error.The proposed construction can correct a single stable burst erasure and a single unstable burst erasure,respectively.Two corresponding decoding methods are presented in the proof of the proposed construction.The code construction and the decoding methods are validated with examples.

Key words: permutation code, flash memory, rank modulation, burst erasure errors

CLC Number:

TN911.22

HE Yaping,HE Yucheng,ZHOU Lin. Permutation codesable to correct stable and unstable burst erasure errors[J].Journal of Xidian University, 2021, 48(3): 49-55.

Figures/Tables 3

References 16

[1]	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. doi: 10.1109/TIT.2010.2043764
[2]	KOVACEVIC M, TAN V Y F. Coding for the Permutation Channel with Insertions,Deletions,Substitutions,and Erasures[C]// Proceedings of the 2017 IEEE International Symposium on Information Theory.Piscataway:IEEE, 2017: 1933-1937.
[3]	慕建君, 赵鹏, 焦晓鹏. 一种纠单个闪存单元移位错误码的译码方法[J]. 西安电子科技大学学报, 2016,43(6):51-55.
	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.
[4]	GABRYS R, YAAKOBI E, MILENKOVIC O. Codes in theDamerau Distance for Deletion and Adjacent Transposition Correction[J]. IEEE Transactions on Information Theory, 2018,64(4):2550-2570. doi: 10.1109/TIT.2017.2778143
[5]	JIANG A, MATEESCU R, SCHWARTZ M, et al. Rank Modulation for Flash Memories[J]. IEEE Transactions on Information Theory, 2009,55(6):2659-2673. doi: 10.1109/TIT.2009.2018336
[6]	韩辉, 慕建君, 焦晓鹏. 切比雪夫距离下系统置换码的编译码算法[J]. 西安电子科技大学学报, 2018,45(6):26-30.
	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.
[7]	HAN H, MU J, HE Y C, et al. CosetPartitioning Construction of Systematic Permutation Codes Under the Chebyshev Metric[J]. IEEE Transactions on Communications, 2019,67(6):3842-3851. doi: 10.1109/TCOMM.26
[8]	CHEE Y M, VU V K, ZHANG X. Permutation Codes Correcting a Single Burst Deletion I:Unstable Deletions[C]// Proceedings of the 2015 IEEE International Symposium on Information Theory.Piscataway:IEEE, 2015: 1741-1745.
[9]	LEVENSHTEIN V I. On Perfect Codes in Deletion and Insertion Metric[J]. Discrete Mathematics and Applications, 1992,2(3):241-258.
[10]	GABRYS R, YAAKOBI E, FAMOUD F, et al. Codes Correcting Erasures and Deletions for Rank Modulation[J]. IEEE Transactions on Information Theory, 2016,62(1):136-150. doi: 10.1109/TIT.2015.2493147
[11]	CHEE Y M, LING S, NGUYEN T T, et al. Permutation Codes Correcting a Single Burst Deletion II:Stable Deletions[C]// Proceedings of the 2017 IEEE International Symposium on Information Theory.Piscataway:IEEE, 2017: 2688-2692.
[12]	SALA F, GABRYS R, DOLECEK L. Deletions in Multipermutations[C]// Proceedings of the 2014 IEEE International Symposium on Information Theory.Piscataway:IEEE, 2014: 2769-2773.
[13]	HAN H, MU J, JIAO X, et al. Codes Correcting a Burst of Deletions for Permutations and Multi-permutations[J]. IEEE Communications Letters, 2018,22(10):1968-1971. doi: 10.1109/LCOMM.2018.2859962
[14]	MU J, HAN H, HE Y C, et al. Multi-permutation Codes Correcting a Single Burst Unstable Erasure[J]. IEEE Communications Letters, 2019,23(4):572-575. doi: 10.1109/COML.4234
[15]	ZHAO P, MU J, JIAO X. Multipermutation Codes Correcting a Predetermined Number of Adjacent Deletions[J]. IEICE Transactions on Fundamentals of Electronics,Communications and Computer Sciences, 2017,100(10):2176-2179.
[16]	ZHAO P, MU J, HE Y, et al. Multipermutation Codes Correcting aBurst of Deletions[J]. IEICE Transactions on Fundamentals of Electronics,Communications and Computer Sciences, 2018,101(2):535-538.

Permutation codesable to correct stable and unstable burst erasure errors

RichHTML

PDF (PC)

Like

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 3

References 16

Related Articles 4

Metrics

Comments

Recommended 10

[1]	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.
[2]	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.
[3]	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.
[4]	ZHENG Xue-feng;HAO Yue;LIU Hong-xia;LI Pei-xian;LIU Dao-guang;HAN Xiao-liang. Study of the hot carrier reliability of the flash memory [J]. J4, 2004, 31(6): 821-824.