MétaCan
Menu
Back to cohort
Record W1514757060 · doi:10.1109/cwit.2015.7255183

Gaussian multiple-access relay channels with non-causal side information at the transmitters

2015· article· en· W1514757060 on OpenAlexaff
A. Sahebaxlam, Soosan Beheshti

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsRelayGaussianRelay channelChannel (broadcasting)Computer scienceEncoderTopology (electrical circuits)Interference (communication)Channel state informationComputer networkAlgorithmTelecommunicationsPower (physics)MathematicsWirelessPhysicsCombinatorics

Abstract

fetched live from OpenAlex

The multiple-access relay channel (MARC) and its Gaussian version are important models in cellular, ad hoc communication systems, and sensor networks and also, this channel is a comprehensive model which consist of two important channels: Relay Channel (RC) and Multiple Access Channel (MAC). In this paper, we study and analyse the two-user state-dependent discrete and memoryless MARC in which the independent states of channel are known non-causally only at the encoders. An achievable rate region by using binning and decode-and-forward (DF) schemes and an outer bound for this model are obtained. We also by using our results obtain an inner bound for two-user Gaussian MARC with identical non-causal side information. Our model includes discrete and continuous (Gaussian) multiple access channel rate region and relay channel rate with non-causal side information. Finally, we evaluate our bounds for Gaussian MARC numerically and illustrate the effect of interference power on bounds.

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 distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.540
Threshold uncertainty score0.366

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.023
GPT teacher head0.245
Teacher spread0.222 · 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 teacher head, 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

Citations1
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Security TechniquesFrench-language works237,207