MétaCan
Menu
Back to cohort
Record W2537496845 · doi:10.1109/lcomm.2016.2619706

Generic Linear Network Code Construction Using Transversal Matroids

2016· article· en· W2537496845 on OpenAlexaff
Morteza Rekab-Eslami, Morteza Esmaeili, T. Aaron Gulliver

Bibliographic record

VenueIEEE Communications Letters · 2016
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsMatroidTransversal (combinatorics)Linear network codingCode (set theory)Computer scienceDual codeAlgorithmRepresentation (politics)Systematic codeMatrix (chemical analysis)Coding (social sciences)Theoretical computer scienceIndependence (probability theory)Discrete mathematicsMathematicsLow-density parity-check codeDecoding methodsProgramming language

Abstract

fetched live from OpenAlex

A generic linear network (GLN) code is the strongest linear network code in terms of the linear independence of the coding vectors. It can be designed by constructing a representation matrix for a transversal matroid. Recently, a new algorithm for constructing this matrix has been developed. In this letter, we present details on the method of constructing a GLN code using transversal matroids, compute the time complexity of this method, and compare it with other algorithms.

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.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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.685
Threshold uncertainty score0.612

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.001
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0030.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.077
GPT teacher head0.297
Teacher spread0.219 · 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.

The models applied no category: nothing in the taxonomy fit this work.
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
Published2016
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Communications LettersSame topicCooperative Communication and Network CodingFrench-language works237,207