{"id":"W3182847896","doi":"10.1109/isit50566.2022.9834826","title":"Trade-Based LDPC Codes","year":2022,"lang":"en","type":"preprint","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Parity-check matrix; Mathematics; Girth (graph theory); Tanner graph; Matrix (chemical analysis); Parity (physics); Invariant (physics); Exponent; Discrete mathematics; Combinatorics; Algorithm; Decoding methods; Error floor","routes":{"ca_aff":true,"ca_fund":true,"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.0002374982,0.0002526144,0.0002219349,0.0004908897,0.0003229087,0.0005243399,0.0003358677,0.0004350454,0.002575914],"category_scores_gemma":[0.00112189,0.0002027494,0.0002225156,0.0005787362,0.0005728113,0.0005643296,0.0005369152,0.0007528365,0.0006372966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004249334,"about_ca_system_score_gemma":0.0004561621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006405626,"about_ca_topic_score_gemma":0.000916998,"domain_scores_codex":[0.9997067,0.00004292342,0.00001618396,0.00006633074,0.0001198856,0.00004797701],"domain_scores_gemma":[0.9991358,0.000240448,0.000092155,0.0002686924,0.0002186736,0.00004422742],"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.0006998116,0.0001357813,0.003160455,0.0003772181,0.00005437639,0.0006904597,0.0003123437,0.2200151,0.2039704,0.3585557,0.006184061,0.2058444],"study_design_scores_gemma":[0.00008559207,0.0002875358,0.002537766,0.00005572387,0.00003353426,0.0009394386,0.00006731525,0.6998892,0.1245247,0.1533954,0.01813755,0.00004621464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2039491,0.0003993788,0.7753966,0.0002611044,0.00007737764,0.0001393573,0.0005774792,0.001015237,0.01818451],"genre_scores_gemma":[0.8997591,0.0002349644,0.09313027,0.00011547,0.00002869403,0.00009190218,0.0003041071,0.00007788502,0.006257519],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002575914,"threshold_uncertainty_score":0.008617282,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01530122453569908,"score_gpt":0.2753598591568853,"score_spread":0.2600586346211862,"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."}}