Cover Image

Optimizing Secrecy Codes Using Gradient Descent

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hunn, David, Harrison, Willie K.
Format:	Preprint
Published:	2024
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Subspace Decomposition of Coset Codes
by: Hunn, David, et al.
Published: (2024)

Secrecy Coding for the Binary Symmetric Wiretap Channel via Linear Programming
by: Nikkhah, Ali, et al.
Published: (2024)

Iterative Gradient Descent Decoding for Real Number LDPC Codes
by: Boncalo, Oana, et al.
Published: (2024)

Finite-Length Analysis of Polar Secrecy Codes for Wiretap Channels
by: Mahdavifar, Hessam, et al.
Published: (2024)

Adaptive Coding for Two-Way Wiretap Channel under Strong Secrecy
by: Chen, Yanling, et al.
Published: (2024)

Achieving Optimal Short-Blocklength Secrecy Rate Using Multi-Kernel PAC Codes for the Binary Erasure Wiretap Channel
by: Lin, Hsuan-Yin, et al.
Published: (2024)

On the Optimum Secrecy Outage Probability and Ergodic Secrecy Rate over Wireless Channels
by: Leroy, Clement, et al.
Published: (2026)

An Information Theoretic Analysis of Ghost Modulation
by: Harman, Daniel, et al.
Published: (2024)

Secrecy Capacity Analysis and Beamforming Optimization for MIMO-VLC Wiretap Channels
by: Yang, Sufang, et al.
Published: (2026)

Secrecy Gain of Formally Unimodular Lattices from Codes over the Integers Modulo 4
by: Bollauf, Maiara F., et al.
Published: (2023)

Feasibility of short blocklength Reed-Muller codes for physical layer security in real environment
by: Billah, Md Munibun, et al.
Published: (2025)

Max-Min Secrecy Rate and Secrecy Energy Efficiency Optimization for RIS-Aided VLC Systems: RSMA Versus NOMA
by: Maraqa, Omar, et al.
Published: (2025)

Exploiting the Degrees of Freedom: Multi-Dimensional Spatially-Coupled Codes Based on Gradient Descent
by: Tanrıkulu, Ata, et al.
Published: (2026)

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
by: Shen, Wei, et al.
Published: (2023)

Secrecy and Privacy in Multi-Access Combinatorial Topology
by: Chinnapadamala, Mallikharjuna, et al.
Published: (2025)

Optimal Quantized Compressed Sensing via Projected Gradient Descent
by: Chen, Junren, et al.
Published: (2024)

Local Approximation of Secrecy Capacity
by: Athanasakos, Emmanouil M., et al.
Published: (2024)

Covert Entanglement Generation and Secrecy
by: Kimelfeld, Ohad, et al.
Published: (2025)

On the Secrecy Capacity of 1-2-1 Atomic Networks
by: Milanian, Mohammad, et al.
Published: (2024)

Multi-terminal Strong Coordination subject to Secrecy Constraints
by: Ramachandran, Viswanathan, et al.
Published: (2024)

Finite-Length Empirical Comparison of Polar, PAC, and Invertible-Extractor Secrecy Codes over the Wiretap BSC
by: Mandalapu, Jaswanthi, et al.
Published: (2026)

Refinements and Extensions of Ziv's Model of Perfect Secrecy for Individual Sequences
by: Merhav, Neri
Published: (2024)

On Secrecy Capacity of Binary Beampointing Channels with Block Memory and Feedback
by: Li, Siyao, et al.
Published: (2025)

On the Secrecy-Sensing Optimization of RIS-assisted Full-Duplex Integrated Sensing and Communication Network
by: Illi, Elmehdi, et al.
Published: (2025)

Riemannian Gradient Descent Method to Joint Blind Super-Resolution and Demixing in ISAC
by: Xiang, Zeyu, et al.
Published: (2024)

How Transformers Learn Causal Structure with Gradient Descent
by: Nichani, Eshaan, et al.
Published: (2024)

On the Theory of Continual Learning with Gradient Descent for Neural Networks
by: Taheri, Hossein, et al.
Published: (2025)

PAC Code Rate-Profile Design Using Search-Constrained Optimization Algorithms
by: Moradi, Mohsen, et al.
Published: (2024)

Perfect Secrecy in the Wild: A Characterization
by: Cavounidis, Costas, et al.
Published: (2025)

Sparse Regression Codes for Secret Key Agreement: Achieving Strong Secrecy and Near-Optimal Rates for Gaussian Sources
by: Athanasakos, Emmanouil M., et al.
Published: (2025)

Average Secrecy Capacity Maximization of Rotatable Antenna-Assisted Secure Communications
by: Jiang, Pengchuan, et al.
Published: (2025)

Secrecy Analysis for MISO Broadcast Systems with Regularized Zero-Forcing Precoding
by: Zhang, Xin, et al.
Published: (2023)

Characterization of the Arithmetic Complexity of the Secrecy Capacity of Fast-Fading Gaussian Channels
by: Boche, Holger, et al.
Published: (2025)

A Mirror Descent-Based Algorithm for Corruption-Tolerant Distributed Gradient Descent
by: Wang, Shuche, et al.
Published: (2024)

Beyond-Diagonal RIS For Enhanced Secrecy and Sensing Gains in Secure ISAC Networks: An Optimization Framework
by: Illi, Elmehdi, et al.
Published: (2026)

Identification Under the Semantic Effective Secrecy Constraint
by: Ibrahim, Abdalla, et al.
Published: (2025)

Byzantine-Resilient Gradient Coding through Local Gradient Computations
by: Hofmeister, Christoph, et al.
Published: (2024)

Innovation-Based Remote State Estimation Secrecy with no Acknowledgments
by: Kennedy, Justin M., et al.
Published: (2022)

Secrecy Analyses of a Full-Duplex MIMOME Network
by: Sohrabi, Reza, et al.
Published: (2019)

Global Convergence Analysis of Vanilla Gradient Descent for Asymmetric Matrix Completion
by: Zhang, Xu, et al.
Published: (2025)