Distributed Space-Time Block Coding for Cooperative Networks with Multiple-Antenna Nodes
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
We present an extension to our previous work on distributed space-time block coding where we considered cooperative networks with a large set of single-antenna decode-and-forward relays N. Here, we consider the general case where each relay node is equipped with N/sub T/ antennas and the destination node has N/sub R/ antennas. It is assumed that at any given time only a small, a priori unknown subset of nodes S C N is active. In the proposed scheme, the signal transmitted by an active node is the product of an information-carrying space-time block code (STBC) matrix, which is identical for all nodes, and a unique node signature matrix. It is shown that existing STBCs designed for N/sub c/ /spl ges/ 2 co-located antennas are a favorable choice for the code matrix guaranteeing a diversity order of d = min {N/sub c/N/sub R/, N/sub T/N/sub S/N/sub R/} if ns nodes are active. Simulation results show that a considerable gain can be achieved by using multiple-antenna nodes even if the antennas are highly correlated.
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.001 |
| Science and technology studies | 0.001 | 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