{"id":"W2913328603","doi":"10.1109/istc.2018.8625374","title":"Computing the Asymptotic Expected Multiplicity of Elementary Trapping Sets (ETSs) in Random LDPC Code Ensembles","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Multiplicity (mathematics); Low-density parity-check code; Computation; Catalan number; Mathematics; Counting problem; Generalization; Decoding methods; Discrete mathematics; Code (set theory); Computer science; Combinatorics; Algorithm","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.001129878,0.0003004364,0.0003877749,0.0008773078,0.0004130963,0.0006968062,0.0007789796,0.0006657699,0.000667869],"category_scores_gemma":[0.01385602,0.0003174876,0.0002746099,0.0005800306,0.001119569,0.001279353,0.0007458403,0.0005446419,0.00009511813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00109631,"about_ca_system_score_gemma":0.0005290582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001107709,"about_ca_topic_score_gemma":0.001927923,"domain_scores_codex":[0.999488,0.0001489065,0.00003412366,0.0001028827,0.0001578456,0.00006830074],"domain_scores_gemma":[0.9934857,0.004647915,0.000718086,0.0004843125,0.000429305,0.000234646],"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.0001619472,0.00005848754,0.01571894,0.00007024778,0.00004527776,0.0002190506,0.00008742103,0.9195637,0.01209002,0.04297524,0.0003310201,0.008678669],"study_design_scores_gemma":[0.000004709129,0.00001826837,0.001072112,0.00000421357,0.000003869777,0.00004342974,0.0000118915,0.9869848,0.00352837,0.008268426,0.00005203802,0.000007834919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8986737,0.00009172778,0.09922273,0.000123017,0.000009336553,0.00001546101,0.0001090764,0.0002029266,0.001552034],"genre_scores_gemma":[0.9817655,0.0000445765,0.01756205,0.00001802667,0.000006649792,0.00002599688,0.0001512748,0.00003433264,0.000391601],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001129878,"threshold_uncertainty_score":0.007954299,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02303872413220732,"score_gpt":0.2900871196368367,"score_spread":0.2670483955046294,"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."}}