{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002199481,0.0005494308,0.0004162985,0.0008878862,0.0003748955,0.0008953097,0.004919915,0.0003093374,0.0009158492],"category_scores_gemma":[0.0001883918,0.000596237,0.0004165582,0.0004041484,0.00008128392,0.001568274,0.001468575,0.001667154,0.0002620294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001290012,"about_ca_system_score_gemma":0.0003448355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005207846,"about_ca_topic_score_gemma":0.000004177052,"domain_scores_codex":[0.9954512,0.0004959462,0.001132707,0.0006596464,0.001863642,0.0003968566],"domain_scores_gemma":[0.9963558,0.000668128,0.001128559,0.001469295,0.0002419252,0.0001362317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000467081,0.0004662864,0.0003132051,0.0002440664,0.0004014434,0.00004237712,0.007806859,0.2158119,0.001094841,0.6952833,0.04967812,0.0283905],"study_design_scores_gemma":[0.001694175,0.0007391568,0.0007182253,0.0005706478,0.00008421155,0.00009127764,0.0005783271,0.6337661,0.0397785,0.1229236,0.1963281,0.002727735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007647805,0.00004218379,0.8474434,0.008574725,0.01869132,0.001240646,0.0005112838,0.003011517,0.1128371],"genre_scores_gemma":[0.971148,0.00007897395,0.01244766,0.01158005,0.0005653155,0.001304238,0.001354366,0.00007837253,0.001443069],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9635001,"threshold_uncertainty_score":0.9999974,"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."}}