{"id":"W2119852332","doi":"10.1109/glocom.2007.301","title":"Deterministic Design of Low-Density Parity-Check Codes for Binary Erasure Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Erasure; Binary erasure channel; Computer science; Algorithm; Binary number; Erasure code; Theoretical computer science; Code (set theory); Decoding methods; Mathematics; Channel capacity; Channel (broadcasting); Arithmetic; Computer 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.0008707315,0.0004240034,0.0004830028,0.0004454846,0.0004367693,0.0005396031,0.0006380773,0.0005087167,0.0005755257],"category_scores_gemma":[0.003433737,0.0003150372,0.0003488448,0.0003762597,0.0007719719,0.000428621,0.0007721022,0.0006024529,0.0001712501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000544494,"about_ca_system_score_gemma":0.0009306544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000546076,"about_ca_topic_score_gemma":0.0008874738,"domain_scores_codex":[0.9992371,0.0002831691,0.00003778386,0.00009108261,0.0002801876,0.00007080679],"domain_scores_gemma":[0.9983348,0.0008070802,0.0002957658,0.0002528427,0.0002513027,0.00005821557],"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.0001130974,0.00005639199,0.001321101,0.0001563364,0.00005189953,0.00008437262,0.00009828505,0.8339906,0.01665452,0.09820776,0.0008322785,0.04843348],"study_design_scores_gemma":[0.0000166976,0.00003966108,0.0001182053,0.00000767182,0.000008543056,0.00003641859,0.000006003538,0.9833098,0.005594488,0.01003255,0.0008173346,0.00001260452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03681632,0.0001613149,0.9609202,0.0001337112,0.00003799532,0.00004163111,0.00005012781,0.0001491035,0.001689597],"genre_scores_gemma":[0.7201966,0.0002468053,0.2780889,0.00009681566,0.00003287948,0.0001791895,0.00008685861,0.00004976818,0.001022211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008707315,"threshold_uncertainty_score":0.004604936,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04368098598646759,"score_gpt":0.3015250718335133,"score_spread":0.2578440858470458,"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."}}