{"id":"W2158681102","doi":"10.1109/isit.1997.613026","title":"Graph theoretic construction of generalized product codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Bipartite graph; Computer science; Tanner graph; Factor graph; Decoding methods; Girth (graph theory); Theoretical computer science; Product (mathematics); Low-density parity-check code; Graph; Block code; Algorithm; Discrete mathematics; Combinatorics; Concatenated error correction code; Mathematics","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.0004500086,0.000505346,0.000467572,0.0008550998,0.0008998665,0.001001521,0.0008992039,0.0005960334,0.00273709],"category_scores_gemma":[0.001502916,0.0004080941,0.0005331989,0.0007320588,0.00173115,0.001541437,0.002166797,0.001721478,0.000673143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004858039,"about_ca_system_score_gemma":0.0008516825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000524188,"about_ca_topic_score_gemma":0.0006491325,"domain_scores_codex":[0.9994515,0.0001746435,0.00001538722,0.00008900739,0.0002013647,0.0000681291],"domain_scores_gemma":[0.9990789,0.0003210807,0.0000638827,0.0001890046,0.0002056203,0.0001415768],"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.00002492782,0.00002001555,0.000196512,0.00006447127,0.00001081485,0.0001596547,0.0001579154,0.009255527,0.004419311,0.9719262,0.001355203,0.01240948],"study_design_scores_gemma":[0.00002580473,0.00006699048,0.0002173481,0.00003716696,0.00001996227,0.0004635415,0.00008796476,0.07287718,0.009046569,0.9001448,0.01697162,0.00004107304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08793043,0.0003402666,0.8826255,0.0005841488,0.000176354,0.0001203466,0.0002113338,0.0005630843,0.02744849],"genre_scores_gemma":[0.5542847,0.000596842,0.4323714,0.0003972084,0.00009355127,0.0002802886,0.0004272766,0.0003515271,0.01119708],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00273709,"threshold_uncertainty_score":0.009156525,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01916667627212578,"score_gpt":0.2382040712021471,"score_spread":0.2190373949300213,"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."}}