{"id":"W2135626675","doi":"10.1109/lcomm.2010.08.100548","title":"Trapping Sets of Fountain Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Fountain code; Binary erasure channel; Low-density parity-check code; Computer science; Luby transform code; Raptor code; Decoding methods; Tornado code; Online codes; Binary number; Erasure; Fountain; Trapping; Algorithm; Channel (broadcasting); Theoretical computer science; Mathematics; Channel capacity; Error floor; Arithmetic; Telecommunications; Biology","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.0004770436,0.00009574972,0.0001299421,0.0001623755,0.0001703093,0.00005153404,0.003746187,0.00005047796,0.000003341048],"category_scores_gemma":[0.00007724606,0.0001037352,0.00006415394,0.0003809623,0.0002054203,0.0002841704,0.000354705,0.0004072091,0.00001165378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002123168,"about_ca_system_score_gemma":0.00003452679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001168547,"about_ca_topic_score_gemma":0.0002026675,"domain_scores_codex":[0.9991529,0.0001201123,0.0002497596,0.0001710584,0.0001456968,0.0001604615],"domain_scores_gemma":[0.9959677,0.0003824019,0.0001512517,0.003375815,0.00008414265,0.00003864406],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000001038967,0.00007220047,0.001641714,0.00001002686,0.00001619124,0.000001044605,0.001547929,0.00001955475,0.9548182,0.017701,0.004669917,0.01950116],"study_design_scores_gemma":[0.0008904586,0.0001623773,0.01875058,0.0003210941,0.00005688897,0.0001842015,0.0002933204,0.1471619,0.7643055,0.01357885,0.0526796,0.001615205],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3834748,0.0000507723,0.5910037,0.02120849,0.0004966366,0.0002167972,0.000003051107,0.0007221236,0.002823571],"genre_scores_gemma":[0.710949,0.00001186883,0.288138,0.000849574,0.00001066387,0.0000244436,0.000001734723,0.000007138052,0.000007573588],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3274742,"threshold_uncertainty_score":0.6961409,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0342706017425371,"score_gpt":0.3088436909048394,"score_spread":0.2745730891623023,"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."}}