{"id":"W2899161352","doi":"10.1109/icc.2019.8761399","title":"Neural Belief Propagation Decoding of CRC-Polar Concatenated Codes","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Cyclic redundancy check; Belief propagation; Computer science; Factor graph; Decoding methods; Polar code; Algorithm; Polar; Redundancy (engineering); Low-density parity-check code; Error detection and correction; Propagation of uncertainty; Concatenated error correction code; Forward error correction; Overhead (engineering); Turbo code; Block code","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.0008282757,0.0007599533,0.0005293086,0.0004713846,0.0003243502,0.0005452489,0.0007337459,0.0007735297,0.0009746983],"category_scores_gemma":[0.005287698,0.0002614908,0.0002760129,0.0006189033,0.0007422157,0.0008579207,0.0006751363,0.0007806944,0.0004076067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007544492,"about_ca_system_score_gemma":0.001229141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009215559,"about_ca_topic_score_gemma":0.00943916,"domain_scores_codex":[0.9993893,0.000156829,0.0000280155,0.00008940074,0.0002557912,0.00008063731],"domain_scores_gemma":[0.9979539,0.0009744397,0.0001734151,0.000156623,0.0007038427,0.00003779592],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004670762,0.00005835994,0.001032586,0.0001071166,0.00004787829,0.0001852784,0.0001240701,0.8150652,0.01872849,0.01716112,0.001504238,0.1455185],"study_design_scores_gemma":[0.000008064236,0.00002203151,0.0001026593,0.00000426499,0.000005966287,0.00002179247,0.000005373236,0.9923398,0.005602842,0.001650564,0.0002313366,0.000005271284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07347401,0.0002871331,0.9210014,0.0002663712,0.00007099091,0.00005088134,0.0001024912,0.0006760425,0.004070698],"genre_scores_gemma":[0.7141445,0.0002997055,0.2795879,0.0001369951,0.00004248925,0.00006597208,0.0002710545,0.00006200287,0.005389422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009215559,"threshold_uncertainty_score":0.01832384,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02877681902638675,"score_gpt":0.2846153124911657,"score_spread":0.2558384934647789,"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."}}