This paper studies coded caching with file and demand privacy (f&d-privacy) which guarantees that each user learns no information neither about other users’ demands, nor about non-demanded files. First, we prove that an f&d-private coded caching system can also resist the attacks of an external eavesdropper. We then characterize the exact memory-rate trade-off for N = K = 2. Finally, we propose coded caching schemes to achieve the minimal-memory point (M = 1,R = K), which is tight if N ≥ 2K, and the minimal-rate point (M = N(K - 1) + 1,R = 1) on the memory-rate trade-off.
8 December 2025 in IEEE Transactions on Information Theory
This paper investigates the maximum coding rate at which data can be transmitted over a noncoherent, multiple-input, multiple-output (MIMO) Rayleigh block-fading channel using an error-correcting code of a given blocklength with a block-error probability not exceeding a given value. A high-SNR normal approximation is derived that becomes accurate as the signal-to-noise ratio (SNR) and the number of coherence intervals over which we code tend to infinity. The obtained normal approximation complements the nonasymptotic bounds that have appeared in the literature, but whose evaluation is computationally demanding. It further lays the theoretical foundation for an analytical analysis of the fundamental tradeoff between diversity, multiplexing, and channel-estimation cost at finite blocklength and finite SNR.
In this paper, we investigate the effect of output quantization on the secrecy capacity of the binary-input Gaussian wiretap channel. As a result, a closed-form expression with infinite summation terms of the secrecy capacity of the binary-input Gaussian wiretap channel is derived for the case when both the legitimate receiver and the eavesdropper have unquantized outputs. In particular, computable tight upper and lower bounds on the secrecy capacity are obtained. Theoretically, we prove that when the legitimate receiver has unquantized outputs while the eavesdropper has binary quantized outputs, the secrecy capacity is larger than that when both the legitimate receiver and the eavesdropper have unquantized outputs or both have binary quantized outputs. Further, numerical results show that in the low signal-to-noise ratio (SNR) (of the main channel) region, the secrecy capacity of the binary input Gaussian wiretap channel when both the legitimate receiver and the eavesdropper have unquantized outputs is larger than the capacity when both the legitimate receiver and the eavesdropper have binary quantized outputs; as the SNR increases, the secrecy capacity when both the legitimate receiver and the eavesdropper have binary quantized outputs tends to overtake.
However, the wheat straw surface was difficult to be penetrated by adhesive due to the wax layer existed on its surface. It is a key point that how to manufacture straw particleboard with traditional resin. This paper explored a novel method to solve this problem by pre-treating straw particles with enzyme and impregnating with resin. Different from conventional spray application, straw was impregnated with phenolic resin (PF). Part of these straws was pretreated with xylanase and lipase before impreanating to improve the bonding between adhesive and straw. The results indicated that when straw was pretreated with lipase and and then applied 10% PF by impregnating, the properties of wheat straw particleboard were optimal, bending strength was 13.81 MPa, elastic modulus was 2.67GPa, internal bond strength was 0.113MPa and 2h thickness swelling was 16.74%.
As a key communication technology in IEEE 802.15.4, Time Slot Channel Hopping (TSCH) enhances transmission reliability and interference immunity by scheduling of time slots and channel assignments. This paper presents a TSCH framework designed to improve packet delivery ratio and anti-interference performance by generating optimal channel hopping sequences that achieve the Lempel-Greenberger bound. The framework employs the Proximal Policy Optimization (PPO) algorithm to predict channel quality, thereby facilitating the selection of higher quality channels in response the dynamic interference changes. Simulation results demonstrate a 7.9% improvement in packet delivery ratio performance compared to previous studies.
16 December 2025 in IEEE Wireless Communications Letters
With the development of the Low-Altitude Aerial Intelligent Network (LAIN), the network imposes stringent demands in terms of spectrum-efficient operation, ultra-low power consumption, enhanced node flexibility, and rapid access latency. The improved channel-hopping-based rendezvous techniques can effectively meet these demands. In this letter, we construct a new class of Asynchronous Asymmetric Channel Hopping Sequence sets with Flexible Lengths (AACHSs-FL). The AACHSs-FL can generate sequences of different lengths to adapt to various network scenarios. Additionally, the AACHSs-FL satisfy even channel use and full Degree-of-Rendezvous, while improving the performance of Maximum Time-to-Rendezvous (MTTR) and Maximum First-Time-to-Rendezvous (MFTTR), thereby enhancing rendezvous efficiency among users. Simulation results show that the MTTR, MFTTR and the TTR variance of the AACHSs-FL outperform most of the existing sequences, thereby significantly improving rendezvous efficiency and better meeting the new requirements of the LAIN.