Advancements in Communication and Data Processing Techniques

The recent publications in the field highlight a significant push towards refining and optimizing communication and data processing techniques, with a particular focus on enhancing security, efficiency, and reliability. A notable trend is the exploration of advanced coding strategies and protocols aimed at improving data compression, secure communication, and system reliability under various constraints. Innovations in channel coding and data compression are addressing the challenges of achieving optimal rates with stringent reliability guarantees, especially in scenarios with limited blocklengths. Additionally, there's a growing interest in developing secure communication protocols that ensure privacy and self-custody, leveraging novel cryptographic techniques and physical tools for secure multi-party computation. The field is also seeing advancements in the understanding of the fundamental limits of communication systems, including the computability of secrecy capacities and the development of new bounds and decoding strategies that enhance performance. These developments are not only pushing the boundaries of what's theoretically possible but are also paving the way for practical applications in areas ranging from digital asset management to covert communication and beyond.

Noteworthy Papers

  • Lossless data compression at pragmatic rates: Introduces sharp bounds for compression rates, emphasizing the importance of pragmatic rates in short blocklength scenarios.
  • A Protocol for Compliant, Obliviously Managed Electronic Transfers: Presents a secure protocol for digital asset management with strong privacy features.
  • Channel Coding for Gaussian Channels with Mean and Variance Constraints: Characterizes optimal performance for Gaussian channels under new constraints, using a novel achievability scheme.
  • Characterization of the Arithmetic Complexity of the Secrecy Capacity of Fast-Fading Gaussian Channels: Explores the computability of secrecy capacities, revealing non-computable numbers in certain scenarios.
  • Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels: Introduces galaxy codes, significantly improving the achievability bound for deterministic identification.

Sources

Lossless data compression at pragmatic rates

A Protocol for Compliant, Obliviously Managed Electronic Transfers

Optimizing a multi-state cold-standby system with multiple vacations in the repair and loss of units

Channel Coding for Gaussian Channels with Mean and Variance Constraints

Characterization of the Arithmetic Complexity of the Secrecy Capacity of Fast-Fading Gaussian Channels

Channel Resolvability Using Multiplicative Weight Update Algorithm

An Improved Lower Bound on Oblivious Transfer Capacity Using Polarization and Interaction

Balance-Based Cryptography: Physically Computing Any Boolean Function

Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels

On Universal Decoding over Discrete Additive Channels by Noise Guessing

Extension of the Poltyrev Bound to Binary Memoryless Symmetric Channels

Covert Communication via Action-Dependent States

Nonasymptotic Oblivious Relaying and Variable-Length Noisy Lossy Source Coding

Dual-Domain Exponent of Maximum Mutual Information Decoding

On entropy-constrained Gaussian channel capacity via the moment problem

Built with on top of