The research introduces a new reversible data hiding (RDH) technique using image interpolation, which enhances visual quality and embedding capacity while ensuring robust security and minimal distortion. The encryption phase segmented secret messages into different lengths and encoded them into code pairs before embedding them within the cover image. This method outperforms similar interpolation RDH algorithms, offering low computing costs and improved security.

This paper considers bit-loading algorithms to maximize throughput under total power and spectral mask constraints in interference-free OFDM systems. The contribution is twofold. First, we propose a simple criterion to switch between two well-known algorithms from the literature: the conventional Greedy and Greedy-based bit-removing (with maximum allowable bit loading initialization) algorithms. Second, we present a new low-complexity loading algorithm that exploits the bit vector obtained by rounding the water-filling algorithm solution to the associated continuous-input rate maximization problem as an efficient initial bit vector of the Greedy algorithm. We theoretically prove that this bit vector has two interesting properties. The first one states that it is an efficient bit vector, i.e., there is no movement of a bit from one subcarrier to another that reduces the total used power. The second one states that the optimized throughput, starting from this initial bit vector, is achieved by adding or removing bits on each subcarrier at most once. Simulation results show the efficiency of the proposed algorithm, i.e., the achievable throughput is maximized with significant reduction of computation cost as compared to many algorithms in the literature.

The aim of this paper is to study the bit-loading and power allocation problem in the presence of interference (Inter-carrier Interference (ICI) and Inter-Symbol Interference (ISI)) in Orthogonal Frequency Division Multiplexing (OFDM) systems. ISI and ICI significantly degrade the performance of OFDM systems and make the resource management optimized without the assumption of interference less efficient. To solve this problem, an initial solution based on the greedy approach is proposed in this paper. Then, several reduced complexity approaches, which yield a little degradation compared to the initial solution, have been developed. Simulation results presented in the context of Power Line Communication (PLC) show that the performance of proposed algorithms is tight with their upper bound. Moreover, these algorithms efficiently improve the system performance as compared to the constant power water-filling allocation algorithm as well as maximum power allocation algorithm.