{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005322283,0.0002820806,0.000295625,0.0001912487,0.002450662,0.0003848867,0.003689363,0.0001350005,0.00009075558],"category_scores_gemma":[0.00002807084,0.0002948397,0.0002385753,0.001026514,0.0002749408,0.000634465,0.00007721635,0.000666698,0.0001234052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001596574,"about_ca_system_score_gemma":0.0001055643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004743999,"about_ca_topic_score_gemma":0.0003100734,"domain_scores_codex":[0.9977538,0.0004758101,0.0005846517,0.0004629766,0.0001875536,0.0005352307],"domain_scores_gemma":[0.9929391,0.00138294,0.0001938982,0.004854619,0.0004236063,0.0002058021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001376942,0.003421825,0.00004062826,0.0001267613,0.0006113735,0.000001188813,0.007265707,0.05336027,0.01707053,0.2722754,0.07321837,0.5724702],"study_design_scores_gemma":[0.000828637,0.0001300373,0.0001744612,0.0001135141,0.00003087222,0.000007215952,0.00009915472,0.9477838,0.001068792,0.002286954,0.04701383,0.0004627322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004534745,0.0003133239,0.9839987,0.01023585,0.0004263952,0.001267767,0.0000172952,0.0005702117,0.002716944],"genre_scores_gemma":[0.8328765,0.001036484,0.1611935,0.001956356,0.00007106937,0.001511722,0.00003295953,0.00004022681,0.001281213],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8944235,"threshold_uncertainty_score":0.9999503,"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."}}