{"id":"W2075239581","doi":"10.1007/s11122-005-0008-4","title":"On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices","year":2005,"lang":"en","type":"article","venue":"Problems of Information Transmission","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Low-density parity-check code; Permutation matrix; Combinatorics; Parity (physics); Permutation (music); Minimum distance; Parity-check matrix; Discrete mathematics; Decoding methods; Algorithm; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002856302,0.001404992,0.0014262,0.001678574,0.001532478,0.001963946,0.002805889,0.002665024,0.003367088],"category_scores_gemma":[0.02862965,0.0007925021,0.0006734909,0.001486764,0.003433945,0.00417231,0.003255603,0.003232129,0.0006845767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001783659,"about_ca_system_score_gemma":0.001475665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007541605,"about_ca_topic_score_gemma":0.0006356509,"domain_scores_codex":[0.9977421,0.001110586,0.00009974583,0.000259587,0.0006112417,0.0001768176],"domain_scores_gemma":[0.9749312,0.02153677,0.001204905,0.000905308,0.0009277283,0.0004942724],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006672505,0.0001278308,0.0008364776,0.0004635655,0.00006587034,0.0001736412,0.0004424242,0.1400839,0.004764858,0.8222533,0.003848718,0.02627218],"study_design_scores_gemma":[0.0001080222,0.00010459,0.0003710394,0.00008402033,0.00002252601,0.0001607961,0.00008721232,0.2342941,0.002263331,0.7611846,0.001272996,0.00004666341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4080456,0.003790121,0.5362896,0.005000243,0.0003693712,0.000139757,0.000722869,0.0003970155,0.04524555],"genre_scores_gemma":[0.8720394,0.00224719,0.1138,0.0005615382,0.0004003335,0.0003399418,0.0007560456,0.000273073,0.009582476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003367088,"threshold_uncertainty_score":0.01510572,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008146864414246495,"score_gpt":0.2206538971931487,"score_spread":0.2125070327789021,"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."}}