MétaCan
Menu
Back to cohort
Record W2129128059 · doi:10.1109/vtcf.2006.287

Tandem Filter Bank-DFT Code for Bursty Erasure Correction

2006· article· en· W2129128059 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 Vehicular Technology Conference · 2006
Typearticle
Languageen
FieldEngineering
TopicPower Line Communications and Noise
Canadian institutionsMcGill University
Fundersnot available
KeywordsComputer scienceErasureDisjoint setsAlgorithmFilter bankQuantization (signal processing)Code (set theory)RowDecoding methodsEncoding (memory)Theoretical computer scienceFilter (signal processing)Artificial intelligenceMathematicsComputer visionDiscrete mathematics

Abstract

fetched live from OpenAlex

DFT encoding over the real (or complex) field has been proposed as a means to reconstruct samples lost in wireless network transmissions. The quantization associated with practical implementations results in reconstruction errors that are particularly large when lost samples occur in bursts (bursty erasures). Here we present a setup that effectively creates disjoint DFT codes along the rows (temporal codevectors) and columns (subband codevectors) of a frame under analysis. An erasure burst along a particular codevector can then be broken up by reconstructing some lost samples along the remaining orientation; these samples can then be used as received samples in reconstructing the original codevector, a technique that we refer to as pivoting. Expressions for the temporal code reconstruction error and for temporal-to-subband pivoting operations are presented.

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: Empirical
Teacher disagreement score0.437
Threshold uncertainty score0.715

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.000
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.015
GPT teacher head0.228
Teacher spread0.213 · 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