{"id":"W2537496845","doi":"10.1109/lcomm.2016.2619706","title":"Generic Linear Network Code Construction Using Transversal Matroids","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Matroid; Transversal (combinatorics); Linear network coding; Code (set theory); Computer science; Dual code; Algorithm; Representation (politics); Systematic code; Matrix (chemical analysis); Coding (social sciences); Theoretical computer science; Independence (probability theory); Discrete mathematics; Mathematics; Low-density parity-check code; Decoding methods; Programming language","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005166132,0.0006808881,0.0005404372,0.0009687311,0.0006666664,0.001027525,0.0009407341,0.0007620463,0.003278604],"category_scores_gemma":[0.002405419,0.0002744774,0.0006085003,0.001022608,0.00086347,0.001611479,0.002337745,0.001208116,0.0006981223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001071202,"about_ca_system_score_gemma":0.001114339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001968769,"about_ca_topic_score_gemma":0.00267273,"domain_scores_codex":[0.9991696,0.0001854741,0.00003957416,0.0001843349,0.0002576249,0.0001634161],"domain_scores_gemma":[0.998562,0.0003343164,0.0001899417,0.0004646244,0.0003308784,0.000118132],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002489933,0.0001268667,0.001384729,0.0002778561,0.00005054212,0.0004463312,0.0003100173,0.2713791,0.04175073,0.5224771,0.008336803,0.153211],"study_design_scores_gemma":[0.00004113302,0.0001175497,0.0002737511,0.00002769225,0.00001983702,0.0003677428,0.00009265811,0.8044552,0.02146194,0.1665896,0.006503638,0.00004929146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06981758,0.000122235,0.9183996,0.0002402255,0.00005009138,0.0001221327,0.0002879038,0.0007388276,0.01022126],"genre_scores_gemma":[0.5347363,0.0002823905,0.4576705,0.0001652626,0.00004128686,0.0002429873,0.0008400356,0.0002198426,0.005801325],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003278604,"threshold_uncertainty_score":0.01096803,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07720417784015142,"score_gpt":0.2965778877077936,"score_spread":0.2193737098676422,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}