{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003934765,0.0002319736,0.000246389,0.0001623407,0.00110176,0.0007409104,0.002200079,0.00008367351,0.00003414489],"category_scores_gemma":[0.00006068528,0.0002385301,0.000069788,0.0002852815,0.0004194549,0.0004385949,0.000522732,0.0003178985,0.0000100388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001323627,"about_ca_system_score_gemma":0.0001345224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008890712,"about_ca_topic_score_gemma":0.000680393,"domain_scores_codex":[0.9984117,0.0002786885,0.0004449842,0.0003857962,0.000210955,0.0002679279],"domain_scores_gemma":[0.996924,0.0005723532,0.0002227018,0.001264027,0.0009399614,0.00007696801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001758917,0.0001763437,0.0001676331,0.000005112216,0.00003108703,7.276254e-7,0.0001741369,0.005535836,0.004476822,0.9830288,0.0008219125,0.005563997],"study_design_scores_gemma":[0.0005226146,0.00004131178,0.0006139286,0.0001184668,0.000009160637,0.00001010006,0.00007142576,0.9898242,0.001643085,0.00376099,0.00309587,0.0002888298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01484466,0.0002423225,0.9664664,0.006180918,0.0004048116,0.0005233128,0.00008088258,0.0001618131,0.01109493],"genre_scores_gemma":[0.9418551,0.0009033942,0.05590364,0.0005254403,0.0001305013,0.00009900233,0.0001245193,0.00001603348,0.0004423318],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9842884,"threshold_uncertainty_score":0.9726976,"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."}}