In caching system, it is desirable to design a coded scheme with the transmission load <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$R$ </tex-math></inline-formula> and subpacketization notation="LaTeX">$F$ as small possible, in order improve efficiency of peak traffic times decrease implementation complexity. Yan et al. reformulated centralized designing corresponding notation="LaTeX">$F\times K$ array...

Coded elastic computing enables virtual machines to be preempted for high-priority tasks while allowing new join ongoing computation seamlessly. This paper addresses coded matrix-matrix multiplications with straggler tolerance by encoding both storage and download using Lagrange codes. In 2018, Yang et al. introduced the first scheme multiplications, achieving a lower computational load requirement. However, this lacks suffers from high upload cost. Zhong (2023) later tackled these...

In the coded caching problem apart from transmission rate, reducing number of packets F ia also meaningful for practical implementation scheme. Yan et al. reformulate centralized schemes as designing a corresponding placement delivery array (PDA). this letter, we propose two concatenating constructions by some known PDAs to obtain new therefore code with low sub-packetization level. Further, comparison and analysis parameters between our is performed.

In an (H, r) combination network, a single content library is serving for ( <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</sub> <sup xmlns:xlink="http://www.w3.org/1999/xlink">H</sup> )users through H relays, where each user has local cache memories and simultaneously accesses subset of r relays on orthogonal non-interfering error-free channels. The combinatorial placement delivery array (CPDA in short) can be used to realize coded caching...

Coded caching schemes with low subpacketization and small transmission rate are desirable in practice due to the requirement of implementation complexity efficiency transmission. Placement delivery arrays (PDA short) can be used generate coded schemes. However, many known schemes, which have subpacketizations, realized by PDAs do not fully use users' content create multicasting opportunities. So we propose a method overcome this drawback. As an application, obtain new scheme, has...

In coded caching system we prefer to design a scheme with low subpacketization and small transmission rate (i.e., the implementation complexity efficient during peak traffic times). Placement delivery arrays (PDA) can be used code schemes. this article propose framework of constructing PDAs via Hamming distance. As an application, two classes schemes linear subpacketizations rates are obtained.

a new zero-watermark algorithm based on audio's statistical character is presented. By using the character, this paper consults mean of approximation coefficients one-dimensional signal and constructs watermark sequence within scheme. way, it efficient to resolve required trade-off between robustness certain attacks imperceptual quality. The experimental results demonstrate that proposed watermarking greatly imperceptible robust against general malicious attacks.

In cloud computing systems, elastic events and stragglers increase the uncertainty of system, leading to computation delays. Coded (CEC) introduced by Yang et al. in 2018 is a framework which mitigates impact using Maximum Distance Separable (MDS) coded storage. It proposed CEC scheme for both matrix-vector multiplication general matrix-matrix applications. However, these applications, cannot tolerate due limitations imposed MDS codes. this paper we propose new uncoded storage Lagrange...

In caching system, it is desirable to design a coded scheme with the transmission load $R$ and subpacketization $F$ as small possible, in order improve efficiency of peak traffic times decrease implementation complexity. Yan et al. reformulated centralized designing corresponding $F\times K$ array called placement delivery (PDA), where $K$ number users. Motivated by several constructions PDAs, we introduce framework for constructing each row indexed vector some matrix index column's labelled...

In an $(H,r)$ combination network, a single content library is delivered to ${H\choose r}$ users through deployed $H$ relays without cache memories, such that each user with local memories simultaneously served by different subset of $r$ on orthogonal non-interfering and error-free channels. The combinatorial placement delivery array (CPDA in short) can be used realize coded caching scheme for networks. this paper, new algorithm realizing network based CPDA proposed the schemes obtained have...

Coded caching schemes with low subpacketization and small transmission rate are desirable in practice due to the requirement of implementation complexity efficiency transmission. Placement delivery arrays (PDA short) can be used generate coded schemes. However, many known have large memory ratios. In this paper, we realize that some generated by PDAs do not fully use users' content create multicasting opportunities thus propose overcome drawback. As an application, obtain two new...

In coded caching system we prefer to design a scheme with low subpacketization and small transmission rate (i.e., the implementation complexity efficient during peak traffic times). Placement delivery arrays (PDA) can be used code schemes. this paper propose framework of constructing PDAs via Hamming distance. As an application, two classes schemes linear subpacketizations rates are obtained.