{"id":"W3196371665","doi":"10.1109/sips52927.2021.00036","title":"High-Throughput VLSI Architecture for GRAND Markov Order","year":2021,"lang":"en","type":"preprint","venue":"","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; Decoding methods; Interleaving; Throughput; Code word; Soft-decision decoder; BCH code; Parallel computing; Algorithm; Markov chain; Code (set theory); Telecommunications; Wireless","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.0001666733,0.0003839488,0.0002514657,0.0003988238,0.0003208111,0.0005676468,0.001067632,0.0003429512,0.006229824],"category_scores_gemma":[0.0004654783,0.0001936942,0.0001992145,0.0003729431,0.0001679262,0.0006432848,0.0004098385,0.0003875142,0.001414734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007904684,"about_ca_system_score_gemma":0.0008570003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002761297,"about_ca_topic_score_gemma":0.00655726,"domain_scores_codex":[0.9998081,0.00002613463,0.00001032828,0.00003773975,0.00007303571,0.00004452962],"domain_scores_gemma":[0.9997516,0.00006041403,0.00003089993,0.00004017463,0.00009799845,0.00001891085],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008761835,0.0003466288,0.004396009,0.0005410438,0.0001777558,0.0008021632,0.0003858692,0.05664003,0.4457421,0.05031645,0.03482886,0.4049469],"study_design_scores_gemma":[0.0001605158,0.001969668,0.003522004,0.00008809298,0.0001910107,0.00114857,0.0001337924,0.5956079,0.3198042,0.01059654,0.06664564,0.0001321852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3385597,0.002186059,0.587043,0.001017946,0.0003292194,0.0003049684,0.0007204243,0.01448028,0.05535832],"genre_scores_gemma":[0.8566796,0.0003449318,0.1257602,0.0002696918,0.00005667686,0.00008465421,0.0006724448,0.0001046487,0.01602729],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006229824,"threshold_uncertainty_score":0.02084082,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01733878739974258,"score_gpt":0.274707906463882,"score_spread":0.2573691190641394,"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."}}