The field of error-correcting codes and cryptography is witnessing significant developments, with a focus on designing efficient and secure codes for various applications. Researchers are exploring new constructions of linear error-correcting codes that can correct a high fraction of adversarial erasures, approaching the Singleton bound. These codes have numerous applications, including the construction of strong linear seeded symbol-fixing extractors and lossless condensers. Furthermore, there is a growing interest in lightweight cryptography algorithms for resource-constrained environments, such as UAV networks, where security and efficiency are crucial. Noteworthy papers in this area include:

• Optimal Erasure Codes and Codes on Graphs, which presents innovative constructions of linear error-correcting codes with optimal rate and erasure-correction trade-offs.
• Analysis of Light-Weight Cryptography Algorithms for UAV-Networks, which evaluates the effectiveness of the ASCON encryption algorithm in UAV networks, demonstrating its potential as a lightweight and efficient cryptographic solution.