The construction of coded caching scheme using trace function and resolvable design over finite fields
Xiuli Wang, Yuanyuan Xing · Discrete Mathematics Algorithms and Applications · 2025
Coded caching is an important method to alleviate network congestion during the peak period of network traffic, so it has been widely used in various network environments. Subpacketization can measure the feasibility and complexity of a coded caching scheme, as well as being a important factor in evaluating the performance of a coded caching scheme. This paper is devoted to obtaining a centralized coded caching scheme with low subpacketization. First, a resolvable design is obtained by using a finite extension of a finite field and a basis of the extension field in combination with the definition of the trace function over the finite field. Second, a placement delivery array is constructed using the obtained resolvable design. Finally, a centralized coded caching scheme is obtained by the placement delivery array, which has lower subpacketization than the existing schemes.