Articles
Publication Date: 2025
International Journal of Communication Networks and Distributed Systems (17543916)31(6)pp. 649-667
The emergence of Internet of Things (IoT) technology has led to extensive connections among various devices which leads to a production of a large amount of heterogeneous data. While, cloud computing is a suitable and efficient processing model for storing and processing this large data, the demand for real-time and delay-sensitive applications is increasing rapidly. Using only cloud computing cannot address this problem properly, because the network bandwidth is limited. Therefore, edge processing as a new processing model and a cloud computing supplement is proposed which is based on a distributed processing architecture. In the proposed reinforcement learning and distributed coding computing (RLCDC) method we harness the DDPG algorithm to manage resources. Additionally, maximum distance separable (MDS) codes are also used to deal with the remaining processors, and to remove the transmitted packets, as well as increasing the network’s operational capacity and throughput. Copyright © 2025 Inderscience Enterprises Ltd.
Parvaresh, F.,
Sobhani, R.,
Abdollahi, A.,
Bagherian, J.,
Jafari, F.,
Khatami bidgoli, M. Publication Date: 2025
IEEE Transactions on Information Theory (00189448)71(6)pp. 4156-4166
In order to overcome the challenges caused by flash memories and also to protect against errors related to reading information stored in DNA molecules in the shotgun sequencing method, the rank modulation method has been proposed. In the rank modulation framework, codewords are permutations. In this paper, we study the largest size P(n, d) of permutation codes of length n, i.e., subsets of the set Sn of all permutations on {1, . . . , n} with the minimum distance at least d ∈ {1, . . . ,(Formula presented)} under the Kendall τ-metric. By presenting an algorithm and two theorems, we improve the known lower and upper bounds for P(n,d) . In particular, we show that P(n,d)=4 for all n ≥ 6 and (Formula presented) (Formula presented) < d ≤ (Formula presented) (Formula presented) . Additionally, we prove that for any prime number n and integer r ≤ − (Formula presented) , P(n,3) ≤ (n-1)! (Formula presented) (Formula presented) . This result greatly improves the upper bound of P(n,3) for all primes n ≥ 37 . © 1963-2012 IEEE.
