{"id":"W2148782634","doi":"10.1109/isit.2007.4557391","title":"Constructing LDPC Codes by 2-Lifts","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":"University of Waterloo","funders":"","keywords":"Low-density parity-check code; Tanner graph; Binary erasure channel; Computer science; Code (set theory); Algorithm; Concatenated error correction code; Tornado code; Erasure code; Binary number; Linear code; Discrete mathematics; Set (abstract data type); Mathematics; Block code; Decoding methods; Error floor; Arithmetic; Channel capacity; Telecommunications","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.000688757,0.0004519765,0.0005615138,0.0009184071,0.0004961686,0.0004876221,0.0003959228,0.000473935,0.001084238],"category_scores_gemma":[0.002914802,0.0003007978,0.0006398088,0.0006160866,0.000837894,0.0005536766,0.001661906,0.0008259381,0.0003711793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003283522,"about_ca_system_score_gemma":0.0005095099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004961994,"about_ca_topic_score_gemma":0.0005123128,"domain_scores_codex":[0.9992025,0.0002458606,0.00004631494,0.00008571085,0.000306577,0.00011291],"domain_scores_gemma":[0.99879,0.0003866329,0.0001486289,0.0003920498,0.0001911185,0.00009164763],"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.0004025813,0.0001330964,0.003103737,0.0002498054,0.00008325024,0.0005169542,0.0004112231,0.3459387,0.07084016,0.4125827,0.002402127,0.1633357],"study_design_scores_gemma":[0.0000724934,0.0002012456,0.0009679905,0.00003288447,0.00002124414,0.0003400354,0.00003646664,0.8353726,0.02861443,0.1296436,0.004633065,0.0000639158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2424283,0.0001865589,0.7515948,0.000168708,0.00006696096,0.00008554135,0.0001205579,0.0004783788,0.004870171],"genre_scores_gemma":[0.7914321,0.0001797381,0.2049372,0.000111496,0.00004662609,0.0001525205,0.000179971,0.0000905768,0.002869629],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001084238,"threshold_uncertainty_score":0.003642559,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01139996652406111,"score_gpt":0.2696407985929484,"score_spread":0.2582408320688873,"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."}}