{"id":"W1964527706","doi":"10.1109/tcomm.2013.061913.110585","title":"Improved Low-Complexity Soliton-Like Network Coding for a Resource-Limited Relay","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Fountain code; Linear network coding; Relay; Computer science; Decoding methods; Coding (social sciences); Computer network; Erasure; Luby transform code; Degree distribution; Encoding (memory); Theoretical computer science; Algorithm; Block code; Mathematics; Concatenated error correction code; Network packet; Complex network","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.0007836724,0.0004144056,0.0004468351,0.00038755,0.0003087667,0.0004061411,0.0008087708,0.0004890441,0.0007765223],"category_scores_gemma":[0.002743984,0.0001347722,0.0003401834,0.0004599399,0.0007631021,0.001081994,0.0006832282,0.0005609016,0.000174152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000919647,"about_ca_system_score_gemma":0.000808753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002059774,"about_ca_topic_score_gemma":0.001780544,"domain_scores_codex":[0.9996011,0.0001444989,0.00001501737,0.00005147654,0.0001342247,0.00005381556],"domain_scores_gemma":[0.9988411,0.0006533318,0.000132056,0.000175067,0.0001640625,0.00003441318],"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.0001953648,0.00005919763,0.0005120234,0.0001770635,0.00004710994,0.0003702837,0.000455677,0.6030365,0.05130385,0.2911544,0.001788832,0.05089965],"study_design_scores_gemma":[0.00001205126,0.00005083194,0.00005433241,0.000008348729,0.00001077928,0.0001154725,0.0000163209,0.9830462,0.005369159,0.009991432,0.001311822,0.00001326688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05050841,0.0004548242,0.9439735,0.0002946575,0.00004615861,0.00004091201,0.00003501964,0.0002150167,0.004431495],"genre_scores_gemma":[0.8262088,0.0005254545,0.1703421,0.0001129649,0.00003047812,0.00006619769,0.00004918165,0.00003254983,0.002632302],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002059774,"threshold_uncertainty_score":0.006672502,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07585027634728102,"score_gpt":0.2960460330290131,"score_spread":0.2201957566817321,"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."}}