{"id":"W3101863493","doi":"10.1109/lcomm.2021.3069668","title":"On Systematic Polarization-Adjusted Convolutional (PAC) Codes","year":2021,"lang":"en","type":"preprint","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Convolutional code; Algorithm; Systematic error; Turbo code; Coding (social sciences); Upper and lower bounds; Code (set theory); Channel code; Polarization (electrochemistry); Theoretical computer science; Decoding methods; Mathematics; Statistics","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.0006576737,0.0005700054,0.0002883605,0.0004670397,0.0003257639,0.0004711297,0.0004702758,0.0005486264,0.0005403939],"category_scores_gemma":[0.003356733,0.0002249807,0.0002101562,0.0007696197,0.001190601,0.000629007,0.0008534319,0.0007891959,0.0002171308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006492829,"about_ca_system_score_gemma":0.001073224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001842682,"about_ca_topic_score_gemma":0.00202716,"domain_scores_codex":[0.9990872,0.0002580854,0.00002735744,0.00008169247,0.0004338191,0.0001118308],"domain_scores_gemma":[0.9982369,0.0008106476,0.0002462163,0.0003265472,0.0003396137,0.00004003831],"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.0002330129,0.00005051478,0.001929192,0.0001864711,0.00005343011,0.0003989452,0.0002159288,0.4578645,0.08829015,0.3283642,0.001698656,0.1207151],"study_design_scores_gemma":[0.00002203335,0.0001314977,0.0006973845,0.00007511926,0.00002805728,0.0003858952,0.00001983481,0.8802977,0.06473377,0.04843684,0.005126779,0.00004502762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1737775,0.0008360021,0.8110871,0.0002939335,0.00006693488,0.00006640296,0.000113937,0.0003567199,0.01340147],"genre_scores_gemma":[0.8068709,0.001261304,0.1886542,0.0001609651,0.00005462862,0.00009016698,0.000160927,0.00005629428,0.002690612],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001842682,"threshold_uncertainty_score":0.004710913,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05154111491655979,"score_gpt":0.2935112615875916,"score_spread":0.2419701466710318,"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."}}