{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003757821,0.0001022223,0.000118182,0.00005198774,0.0008359916,0.0002421411,0.004682973,0.00003298726,0.00000217671],"category_scores_gemma":[0.0001338442,0.00007793788,0.00004729543,0.00007920422,0.0006539368,0.0002735278,0.0006097519,0.0002198124,0.000008285602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002790868,"about_ca_system_score_gemma":0.00001820717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006577726,"about_ca_topic_score_gemma":0.00008554949,"domain_scores_codex":[0.9992312,0.000125678,0.0001719581,0.00018387,0.0001496844,0.0001376575],"domain_scores_gemma":[0.993232,0.0005340056,0.0002216302,0.005924466,0.00005931741,0.00002864393],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004692585,0.0006984656,0.03769747,0.00006574548,0.0001797566,0.00001195605,0.01048244,0.00002913734,0.1960606,0.5364898,0.1836922,0.03454547],"study_design_scores_gemma":[0.001869692,0.0008044227,0.2161803,0.002227776,0.0001450087,0.00009507736,0.0004594738,0.09159432,0.2162801,0.03510855,0.4321565,0.003078842],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.60447,0.0003442167,0.1526297,0.2284441,0.0006734612,0.0004144961,0.00001066739,0.0003379448,0.0126754],"genre_scores_gemma":[0.9747072,0.00008451189,0.02288927,0.002146302,0.00001548646,0.00003422559,6.684712e-7,0.000008473221,0.0001138319],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5013813,"threshold_uncertainty_score":0.8702207,"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."}}