VGU RESEARCH REPOSITORY
Please use this identifier to cite or link to this item:
https://epub.vgu.edu.vn/handle/dlibvgu/1859| Title: | Ranking problem for constant-weight gray codes for local rank modulation | Authors: | Tran Ngan Thao | Keywords: | Multi-level cell flash;Rank modulation scheme;Constant weight | Issue Date: | 2024 | Abstract: | The local rank modulation scheme, a generalization of the rank modulation scheme, is proposed for accurate and effective data representation in flash memory. In this scheme, a sliding window traversing a sequence of real-valued variables yields a sequence of permutations. We focus on constant-weight Gray codes for the scheme. We describe the construction for generating Gray code in the case of weight 2 and weight 3. By dividing the known construction into smaller parts with similar characteristics, we successfully expose ranking and un-ranking methods for the constructed Gray code. As a result, for both cases, the calculations have remarkable time complexities. Specifically, for the weight 2 case, the complexity of ranking and un-ranking calculation is at constant time. Whereas, in the case of weight 3, we obtain calculations with logarithmic time complexity |
URI(1): | https://epub.vgu.edu.vn/handle/dlibvgu/1859 | Rights: | Attribution-NonCommercial 4.0 International |
| Appears in Collections: | Computer Science (CS) |
Files in This Item:
| File | Description | Size | Format | Existing users please Login |
|---|---|---|---|---|
| Ranking problem for constant-weight gray codes for local rank modulation.pdf | 9.22 MB | Adobe PDF |
Page view(s)
48
checked on Oct 16, 2025
Download(s)
19
checked on Oct 16, 2025
Google ScholarTM
Check
This item is licensed under a Creative Commons License