Mollard Code as a Robust Nonlinear Code
- 26 Downloads
We consider the Mollard construction from the point of view of its efficiency for detecting multiple bit errors. We propose a generalization of the classical extended Mollard code to arbitrary code lengths. We show partial robustness of this construction: such codes have less undetected and miscorrected errors than linear codes. We prove that, for certain code parameters, the generalization of the Mollard construction can ensure better error protection than a generalization of Vasil’ev codes.
Unable to display preview. Download preview PDF.
- 1.Wang, X., Dong, G., Pan, L., and Zhou, R., Error Correction Codes and Signal Processing in Flash Memory, Flash Memories, Stievano, I., Ed., Rijeka, Croatia: InTech, 2011, pp. 57–82. Available at https://www.intechopen.com/download/pdf/19378.Google Scholar
- 2.Wang, Z., Karpovsky, M., and Kulikowski, K.J., Replacing Linear Hamming Codes by Robust Nonlinear Codes Results in a Reliability Improvement of Memories, in Proc. 2009 IEEE/IFIP Int. Conf. on Dependable Systems and Networks (DSN), Estoril, Lisbon, Portugal, June 29–July 2, 2009, pp. 514–523.Google Scholar
- 6.Hergert, F., Algebraische Methoden für nichtlineare Codes, Dissertation, Technische Hochschule Darmstadt, Germany, 1985.Google Scholar
- 8.Solov’eva, F.I., Survey on Perfect Codes, Mat. Vopr. Kibern., 2013, vol. 18, pp. 5–34.Google Scholar