MétaCan
Menu
← Back to cohort
Record W1992777992 · doi:10.1109/pimrc.2008.4699956

Code construction for the selective TDMA cooperative broadcast channel

2008· article· en· W1992777992 on OpenAlexaff
Lina Mroueh, Mohamed Oussama Damen, S. Rouquette-Leveil, Ghaya Rekaya Ben-Othman, Jean‐Claude Belfiore

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsTime division multiple accessComputer scienceMultiplexingComputer networkBase stationBroadcasting (networking)Channel (broadcasting)Asynchronous communicationTelecommunications linkCode (set theory)Telecommunications

Abstract

fetched live from OpenAlex

In this paper, the selective time division multiple access (S-TDMA) strategy is studied in the downlink channel. This strategy consists in transmitting data to the user with the largest capacity. The diversity and multiplexing gains that can be achieved by this sub-optimal strategy are evaluated and then compared to the optimal gains over the broadcast channel. Codes construction is then proposed to achieve the diversity multiplexing tradeoff (DMT) of the S-TDMA. These codes are extended to the scenario of cooperating asynchronous broadcasting base stations where new codes that are suitable for this scenario are proposed and analyzed.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0000.000
Open science0.0000.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.065
GPT teacher head0.285
Teacher spread0.219 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network Coding→French-language works237,207→