MétaCan
Menu
Back to cohort
Record W2808059776 · doi:10.1109/tit.2019.2898224

Coupling Data Transmission for Multiple-Access Communications

2019· preprint· en· W2808059776 on OpenAlexafffund
Dmitri Truhachev, Christian Schlegel

Bibliographic record

VenueIEEE Transactions on Information Theory · 2019
Typepreprint
Languageen
FieldComputer Science
TopicError Correcting Code Techniques
Canadian institutionsDalhousie University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsDemodulationDecoding methodsComputer scienceAdditive white Gaussian noiseAlgorithmData streamEncoderError detection and correctionSingle antenna interference cancellationChannel (broadcasting)Theoretical computer scienceTelecommunications

Abstract

fetched live from OpenAlex

We consider a signaling format where the information to be communicated from a single or multiple transmitters to a receiver is modulated via a superposition of independent data streams. Each data stream is formed by error-correction encoding, constellation mapping, replication and permutation of symbols, and application of signature sequences. The relations between the data bits and modulation symbols transmitted over the channel can be represented by a sparse graph. In the case where the modulated data streams are transmitted with time offsets the receiver observes spatial coupling of the individual graphs into a graph chain enabling efficient demodulation/decoding. We prove that a two-stage demodulation/decoding method, in which iterative demodulation based on symbol estimation and interference cancellation is followed by parallel error-correction decoding, achieves capacity on the additive white Gaussian noise channel asymptotically. We compare the performance of the two-stage receiver to the receiver which utilizes hard-decision decoding feedback between the error-correction decoders and the iterative demodulator and estimate the gap between the achievable spectral efficiency and the channel capacity.

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.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Open science
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.695
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0010.000
Scholarly communication0.0010.004
Open science0.0090.000
Research integrity0.0000.001
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.090
GPT teacher head0.351
Teacher spread0.261 · 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.

Study designSimulation or modeling
Domainnot available
GenreMethods

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
Published2019
Admission routes2
Has abstractyes

Explore more

Same venueIEEE Transactions on Information TheorySame topicError Correcting Code TechniquesFrench-language works237,207