{"id":"W2766124948","doi":"10.1109/lcomm.2017.2767028","title":"Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Code (set theory); Upper and lower bounds; Combinatorics; Computer science; Discrete mathematics; Mathematics; Algorithm; Programming language","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.002246178,0.00243769,0.001896721,0.002906689,0.001554902,0.003112646,0.00237256,0.002092328,0.00585415],"category_scores_gemma":[0.02133898,0.0009751264,0.0009833182,0.002959896,0.001846646,0.00588685,0.003685249,0.005498404,0.002918484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003060149,"about_ca_system_score_gemma":0.001852996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001871859,"about_ca_topic_score_gemma":0.002549288,"domain_scores_codex":[0.9956866,0.0007561982,0.0002255347,0.0006163452,0.001989047,0.0007262529],"domain_scores_gemma":[0.9870154,0.009392015,0.00055252,0.001371175,0.001333365,0.000335625],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008557559,0.0003428193,0.002041166,0.001499773,0.0001655409,0.0005194373,0.0005646193,0.4194013,0.03683091,0.3709472,0.01207349,0.154758],"study_design_scores_gemma":[0.00005705464,0.0001454867,0.0007324462,0.0002538938,0.00005076413,0.0003416126,0.00009699324,0.7259612,0.01676141,0.243201,0.01229481,0.0001033684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06238633,0.01713104,0.8670016,0.002737781,0.0004559803,0.0001681492,0.001104461,0.0009044294,0.04811024],"genre_scores_gemma":[0.712105,0.01221745,0.2550133,0.001466529,0.0007688673,0.000775634,0.002185173,0.000555835,0.01491224],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00585415,"threshold_uncertainty_score":0.02220303,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03862617650656103,"score_gpt":0.2988150922925174,"score_spread":0.2601889157859564,"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."}}