Hoạt động trong tuần

Thời gian: 9h - 10h, thứ 5 ngày 13 tháng 2 năm 2025

Địa điểm: Phòng 612, nhà A6, Viện Toán học

Tóm tắt: 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 represent two constructions for Gray codes of weights 2 and 3 proposed by E.Gad et. al. by grouping transition rules to create more easily calculable paths. From that we give calculations for the ranking and un-ranking on these Gray codes. Additionally, we show that the calculations are efficient by showing their running time in constant and logarithmic time for Gray codes of weights 2 and 3 respectively.