The Construction and Decoding Method of Multiple Permutation Codes Based on Matrix Representation in Flash Memory
A technology of matrix representation and construction method, which is applied in the construction and decoding fields of multiple replacement codes, can solve the problems of complex decoding method and low code rate of multiple replacement codes, simplify the decoding method, increase the number of codewords, improve The effect of bit rate
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0056] The specific steps of the present invention will be further described below in conjunction with the drawings and embodiments.
[0057] Refer to attached figure 1 , to further describe the specific steps of a method for constructing multiple replacement codes based on matrix representation in the flash memory of the present invention.
[0058] Step 1, use the following permutation code construction formula to construct a Levenshtein permutation code that corrects one symbol unchanged and deletes the SID error;
[0059]
[0060] in, Indicates that the linear congruence equation with a code length of n is a Levenshtein permutation code that corrects 1 symbol unchanged and deletes SID errors. The value range of n is [1,∞), and the value range of a is {0,1 ,...,n-1}, σ represents a permutation whose length is equal to the code length n, ∈ represents a symbol, Indicates the set of all permutations on the set {1,2,...,n}, : means The permutation σ that satisfies cert...
PUM

Abstract
Description
Claims
Application Information

- R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com