{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007400833,0.0001028972,0.0001082706,0.00008123615,0.00008951698,0.00009425428,0.0006613937,0.00005716498,0.00002189117],"category_scores_gemma":[0.0001068077,0.00009593218,0.00003480747,0.000305213,0.00004792948,0.0002835917,0.0002133882,0.0001385168,0.00003897109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005746008,"about_ca_system_score_gemma":0.00002276556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000117596,"about_ca_topic_score_gemma":0.000121065,"domain_scores_codex":[0.9989811,0.00002242746,0.0002014056,0.0002856929,0.0001968329,0.0003125129],"domain_scores_gemma":[0.999149,0.0002413297,0.00007109193,0.000392854,0.00006616528,0.00007962257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000004114257,0.00005498334,0.0309263,0.00001114054,0.00001501877,0.0000368073,0.0006414465,7.370432e-7,0.02255715,0.3396914,0.05008674,0.5559741],"study_design_scores_gemma":[0.0002523125,0.0001183733,0.0007200204,0.00004427811,0.000004452138,0.0002335782,0.0005662563,0.008357099,0.9622051,0.01087921,0.01601598,0.0006033063],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02846062,0.00003731092,0.864549,0.0003078403,0.0002965876,0.00006838315,4.844331e-7,0.001695903,0.1045839],"genre_scores_gemma":[0.6530613,0.000001237801,0.3458853,0.0003781211,0.00002511367,0.000001476251,6.07297e-7,0.000005918527,0.0006409282],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.939648,"threshold_uncertainty_score":0.3912001,"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."}}