{"id":"W2147861990","doi":"10.1109/lcomm.2004.839612","title":"Improved Progressive-Edge-Growth (PEG) Construction of Irregular LDPC Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":192,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Computer science; Enhanced Data Rates for GSM Evolution; Turbo code; PEG ratio; Block code; Block (permutation group theory); Construct (python library); Simple (philosophy); Mathematics; Decoding methods; Telecommunications; Combinatorics; 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.0003124257,0.0003935152,0.0003993062,0.0004919366,0.000353055,0.000312775,0.0005450947,0.0004967464,0.0008475609],"category_scores_gemma":[0.001493932,0.0001608464,0.0002879509,0.0006551656,0.0005709082,0.0007288373,0.001034366,0.0008898086,0.0003482762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002473727,"about_ca_system_score_gemma":0.00048482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006397579,"about_ca_topic_score_gemma":0.0007857318,"domain_scores_codex":[0.9997528,0.00005813043,0.00001440711,0.00003565125,0.0001014231,0.00003750467],"domain_scores_gemma":[0.9993665,0.0001900971,0.0000622286,0.0002282199,0.0001160595,0.00003699349],"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.0004705912,0.0001576273,0.002240945,0.0003244205,0.00004797869,0.0006048691,0.0003573064,0.2670764,0.1495878,0.175714,0.005279663,0.3981384],"study_design_scores_gemma":[0.00007715913,0.0001851661,0.0006507043,0.00002565265,0.00002738002,0.0006006876,0.00003832896,0.8522188,0.08892177,0.04019374,0.0170085,0.00005204185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08495028,0.0002794437,0.9066623,0.0002404959,0.00007206495,0.0001051933,0.0001794847,0.0009326186,0.006578029],"genre_scores_gemma":[0.4283963,0.0003637793,0.5664622,0.0001200324,0.00002590143,0.0001259786,0.0004191176,0.0001188419,0.003967733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0008475609,"threshold_uncertainty_score":0.002835333,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01934133079425129,"score_gpt":0.2719253126176138,"score_spread":0.2525839818233625,"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."}}