MétaCan
Menu
← Back to cohort
Record W2150714640 · doi:10.1109/icc.2008.238

The Impact of Noise Correlation on the Single-Symbol ML Decodable Distributed STBCs

2008· article· en· W2150714640 on OpenAlexaff
Zhihang Yi, I.-M. Kim

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsQueen's University
Fundersnot available
KeywordsMonomialUpper and lower boundsUncorrelatedBandwidth (computing)MathematicsBlock codeBlock (permutation group theory)AlgorithmComputer scienceDiscrete mathematicsCombinatoricsTelecommunicationsStatisticsDecoding methodsMathematical analysis

Abstract

fetched live from OpenAlex

Very recently, we proposed the distributed orthogonal space-time block codes (DOSTBCs) in [1]. We showed that the DOSTBCs achieved the single-symbol maximum likelihood (ML) decodability and the full diversity order. Furthermore, we studied some special DOSTBCs, namely the row- monomial DOSTBCs, which generated uncorrelated noises at the destination. We showed that the row-monomial DOSTBCs achieved approximately twice higher bandwidth efficiency than the repetition-based cooperative strategy. However, the data-rate of the DOSTBC was not analyzed in [1]. In this paper, we consider the general DOSTBCs, which possibly generate correlated noises at the destination. We derive an upper bound of the data- rate of the DOSTBC. This upper bound is larger than that of the row-monomial DOSTBC, and hence, the DOSTBCs can potentially improve the bandwidth efficiency of the cooperative network.

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.002
metaresearch head score (Gemma)0.014
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.014
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.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.063
GPT teacher head0.284
Teacher spread0.221 · 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

Citations1
Published2008
Admission routes1
Has abstractyes

Explore more

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