MIMO Broadcast Channel with Arbitrarily Varying Eavesdropper Channel: Secrecy Degrees of Freedom
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
A two-receiver MIMO broadcast-wiretap channel is considered where the channel state of the eavesdropper is arbitrarily varying. It is assumed that the eavesdropper knows this channel state perfectly whereas the legitimate nodes have no knowledge of it. It is further assumed that the eavesdropper experiences no additive noise. The channel between the transmitter and the two legitimate receivers is a constant MIMO Gaussian broadcast channel. This paper establishes the secrecy degrees of freedom region for transmitting a common-confidential message as well as a private- confidential message to each receiver. It is observed that a straightforward extension of single user random binning does not achieve the optimal secrecy degrees of freedom (s.d.o.f.) region. The proposed coding scheme that achieves the s.d.o.f. region involves simultaneous diagonalization of the channel matrices of the two legitimate receivers using the generalized singular value decomposition (GSVD) as well as a particular \emph{structured binning} across codebooks that minimizes the rate of the fictitious message. While the focus is on achieving weak secrecy for ease of exposition, an outline is provided on how the results can be extended for achieving strong secrecy.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it