{"id":"W2156541068","doi":"10.1109/tcomm.2009.06.070048","title":"Error rate estimation of low-density parity-check codes on binary symmetric channels using cycle enumeration","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Enumeration; Low-density parity-check code; Decoding methods; Binary number; Algorithm; Code (set theory); Discrete mathematics; Parity (physics); Mathematics; Word error rate; Computer science; Combinatorics; Statistics; Arithmetic; Artificial intelligence; Physics","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.0006265565,0.0002081093,0.0002557054,0.0006627365,0.0007308673,0.00009986947,0.001255899,0.0001412811,0.000004955583],"category_scores_gemma":[0.00005606595,0.0002131679,0.0001200282,0.001483551,0.0000950466,0.0006374101,0.00001421053,0.0005206254,0.00002487046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001825162,"about_ca_system_score_gemma":0.0000930357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001776648,"about_ca_topic_score_gemma":0.00005118148,"domain_scores_codex":[0.9982446,0.0004538106,0.0004648244,0.0003372738,0.0002754987,0.0002240294],"domain_scores_gemma":[0.9965625,0.0005405115,0.000267486,0.002328286,0.0002243975,0.00007680517],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007511868,0.00349982,0.00001715259,0.0000527175,0.00007863287,0.000003760204,0.002595038,0.7858919,0.05016629,0.01731828,0.0002122335,0.1400891],"study_design_scores_gemma":[0.000188129,0.0003012163,0.0004164192,0.0001213903,0.00002864887,0.000009216076,0.00002733689,0.8795348,0.1155761,0.003556597,0.00002877296,0.0002114071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07049601,0.00003422005,0.9257951,0.001998649,0.0003116731,0.0003858208,0.0000137537,0.0005688838,0.0003958723],"genre_scores_gemma":[0.8996701,0.00008711626,0.09987196,0.0002620916,0.00001097412,0.0000303137,0.00000960694,0.00001385326,0.00004398035],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8291741,"threshold_uncertainty_score":0.8692734,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05348081100925509,"score_gpt":0.3259094950104341,"score_spread":0.272428684001179,"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."}}