MétaCan
Menu
Back to cohort
Record W2142122479 · doi:10.1109/glocom.2005.1577852

Low-density parity-check convolutional codes applied to packet based communication systems

2005· article· en· W2142122479 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

VenueGLOBECOM '05. IEEE Global Telecommunications Conference, 2005. · 2005
Typearticle
Languageen
FieldComputer Science
TopicError Correcting Code Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsLow-density parity-check codeEncoderConvolutional codeComputer scienceSerial concatenated convolutional codesNetwork packetTurbo codeAlgorithmDecoding methodsCommunications systemForward error correctionBlock codeTheoretical computer scienceConcatenated error correction codeComputer network

Abstract

fetched live from OpenAlex

In this paper, the application of low-density parity-check convolutional codes (LDPC-CCs) to packet based communication systems is studied. By presenting analysis of encoder and decoder design as well as simulation results for such systems, we show that LDPC-CCs are more suited to packet based applications than LDPC block codes (LDPC-BCs). This is due to their ability to operate on arbitrary lengths of data, lower encoder complexity and the performance gain of presetting and termination. Moreover, in this paper, we propose an algorithm for terminating the LDPC-CC encoder from any state to the all-zero state.

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

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.002
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0070.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.001

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.028
GPT teacher head0.283
Teacher spread0.255 · 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