{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002037193,0.00008275532,0.0001266482,0.0001192548,0.00004251674,0.00002758191,0.0004355978,0.0000266269,0.0001053416],"category_scores_gemma":[0.00006298413,0.00006868742,0.00005044398,0.0003875433,0.0001282694,0.0001771073,0.0000846227,0.0000635961,0.00001175228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001091325,"about_ca_system_score_gemma":0.000007225343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003382945,"about_ca_topic_score_gemma":0.000006048357,"domain_scores_codex":[0.9992181,0.00006942696,0.0001818972,0.0002421052,0.0001577997,0.0001306624],"domain_scores_gemma":[0.9992299,0.00004271583,0.00008902025,0.00051451,0.00009623361,0.00002763616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000002367639,0.00004359661,0.001385415,0.00001533734,0.000009370789,0.000001554377,0.0004358892,0.000006660906,0.009277103,0.9301457,0.002158969,0.05651805],"study_design_scores_gemma":[0.0002811482,0.0002041155,0.0004967345,0.00003665151,0.00001168103,0.0001448648,0.00003884052,0.03615744,0.7331393,0.22862,0.000554304,0.0003149568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1667178,0.000249788,0.7936111,0.0009259066,0.000519476,0.000250651,6.451832e-7,0.001389565,0.03633509],"genre_scores_gemma":[0.6801441,0.00003754232,0.3195265,0.00005063551,0.00001571381,0.000006211735,1.681721e-7,0.000003970898,0.0002151446],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7238622,"threshold_uncertainty_score":0.2800992,"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."}}