{"id":"W2121304904","doi":"10.1109/icc.2006.255029","title":"Low-Complexity Cooperative Coding for Sensor Networks using Rateless and LDGM Codes","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Relay; Coding (social sciences); Online codes; Wireless sensor network; Computer network; Linear network coding; Channel (broadcasting); Node (physics); Decoding methods; Distributed computing; Algorithm; Block code; Linear code; Mathematics; Engineering","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.001471202,0.0004605277,0.0003978718,0.0004293198,0.0003276002,0.0005270254,0.0007625503,0.0006692822,0.0005015891],"category_scores_gemma":[0.005224932,0.0002352903,0.0002800352,0.0005425831,0.001284194,0.001105453,0.001012161,0.0007319245,0.0001478283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001052125,"about_ca_system_score_gemma":0.0007335799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001279895,"about_ca_topic_score_gemma":0.001295672,"domain_scores_codex":[0.9991912,0.000374493,0.00002178212,0.00004580366,0.0003146916,0.00005193032],"domain_scores_gemma":[0.9981115,0.001262697,0.0002009755,0.0002266894,0.0001721826,0.00002597865],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001005885,0.00003411763,0.0003956222,0.0001213774,0.00002420085,0.0001709222,0.0002970455,0.6714904,0.01358688,0.2826123,0.0008406178,0.03032577],"study_design_scores_gemma":[0.0000145809,0.00003520694,0.00005623446,0.00001078277,0.000004765178,0.00004455441,0.00001271095,0.9517071,0.001463915,0.04601003,0.0006309688,0.000009146381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02647057,0.0004581616,0.9706846,0.0002521969,0.00001757576,0.00003493774,0.00002122471,0.0001110935,0.001949609],"genre_scores_gemma":[0.8209498,0.0006230015,0.176489,0.0001156698,0.00004072515,0.0001869659,0.00005394311,0.00002658288,0.001514305],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001471202,"threshold_uncertainty_score":0.007780552,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2053501897785849,"score_gpt":0.375488632811532,"score_spread":0.1701384430329471,"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."}}