MétaCan
Menu
Back to cohort
Record W3173223865 · doi:10.1109/twc.2021.3091719

Spinal Codes Over Fading Channel: Error Probability Analysis and Encoding Structure Improvement

2021· article· en· W3173223865 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Wireless Communications · 2021
Typearticle
Languageen
FieldComputer Science
TopicError Correcting Code Techniques
Canadian institutionsUniversity of Windsor
FundersNational Natural Science Foundation of China
KeywordsConcatenation (mathematics)FadingComputer scienceDecoding methodsRayleigh fadingAlgorithmConcatenated error correction codeBlock codeEncoding (memory)MathematicsArtificial intelligenceArithmetic

Abstract

fetched live from OpenAlex

In order to facilitate the reliability of data transmission of Spinal codes over the fading channel, performance analysis of Spinal codes is conducted, and an improved encoding structure is proposed. First, we derive an approximate frame error rate (FER) upper bound for Spinal codes over the Rayleigh fading channel in the finite block length (FBL) regime. Then, inspired by the FER analysis process, we propose an improved encoding structure, named self-concatenation structure, to reduce the FER of Spinal codes. In addition, a parallel structure is proposed for Spinal codes to improve the decoding throughput. For the self-concatenation structure, simulation results show that it exhibits a significant gain in anti-noise performance compared with the original Spinal codes over the Rayleigh fading channel. For the parallel structure, we find that by combining the parallel structure with the self-concatenation structure, not only is the encoding and decoding throughput of Spinal codes significantly improved but also the FER of Spinal codes is reduced.

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 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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.752
Threshold uncertainty score0.978

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.002
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0010.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.036
GPT teacher head0.304
Teacher spread0.268 · 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