{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004395489,0.0002880231,0.0005226351,0.001118378,0.001407757,0.001150971,0.0008897031,0.001226089,0.002006876],"category_scores_gemma":[0.005428843,0.0002986134,0.0003092389,0.000577185,0.001678035,0.001328656,0.001820837,0.00114295,0.0003628141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007015083,"about_ca_system_score_gemma":0.0004281985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001069112,"about_ca_topic_score_gemma":0.0007092073,"domain_scores_codex":[0.9992374,0.0001593647,0.00003319883,0.00008573059,0.0003506791,0.0001336181],"domain_scores_gemma":[0.997489,0.001254275,0.0002961135,0.0004311238,0.0003769746,0.0001526342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003639926,0.00008829733,0.002016064,0.0001803608,0.00005815379,0.0007666984,0.000778536,0.1104378,0.04781829,0.7979261,0.002997848,0.03656803],"study_design_scores_gemma":[0.00004355339,0.0001435773,0.0009011542,0.00005122997,0.00002064734,0.0007601089,0.000154118,0.6087919,0.03842008,0.3457222,0.004899086,0.00009226101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6802303,0.0008213649,0.2926092,0.0006403833,0.0001458429,0.00008048482,0.0002086722,0.0006423682,0.0246213],"genre_scores_gemma":[0.9776238,0.000168583,0.01763587,0.0001226808,0.00002306372,0.00005946054,0.00008626683,0.00006112225,0.004219127],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002006876,"threshold_uncertainty_score":0.006713688,"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."}}