{"id":"W2953439278","doi":"10.1109/tcsii.2019.2924455","title":"High-Throughput Low-Latency Encoder and Decoder for a Class of Generalized Reed–Solomon Codes for Short-Reach Optical Communications","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Encoder; Computer science; Latency (audio); Throughput; CMOS; Computer hardware; Power consumption; Error detection and correction; Low latency (capital markets); Forward error correction; Decoding methods; Embedded system; Power (physics); Electronic engineering; Computer network; Telecommunications; Algorithm; Engineering; Wireless; Operating system","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006627059,0.0003085479,0.0006389613,0.0002446311,0.0005413908,0.0001491718,0.0011797,0.000239413,0.000006258585],"category_scores_gemma":[0.00001349689,0.00031348,0.0003004855,0.0003382073,0.0002767912,0.0005132473,0.00002301309,0.0002278514,0.000003702288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004843119,"about_ca_system_score_gemma":0.00008960965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001888851,"about_ca_topic_score_gemma":0.00006347035,"domain_scores_codex":[0.9975981,0.0002113743,0.0007284433,0.0007078683,0.0003038915,0.0004503805],"domain_scores_gemma":[0.9965988,0.0009616449,0.0001818738,0.001788624,0.0003146096,0.0001544058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003533412,0.001874415,0.0001243209,0.001357273,0.0008237057,0.000002479362,0.007448,0.02051006,0.1869227,0.7361937,0.0005869383,0.04380317],"study_design_scores_gemma":[0.01968892,0.006516008,0.0005363013,0.0035288,0.001233301,0.0003170058,0.002291609,0.6212891,0.2833003,0.03394734,0.02246101,0.00489032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.082312,0.00039213,0.913654,0.0002418426,0.001003674,0.001772695,0.0002238938,0.0001845469,0.0002151785],"genre_scores_gemma":[0.9809983,0.00009264518,0.01757286,0.00009263957,0.00005233123,0.0009033685,0.0000155285,0.00004074861,0.0002315694],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8986863,"threshold_uncertainty_score":0.9999318,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0281348514875513,"score_gpt":0.2672304442052644,"score_spread":0.2390955927177131,"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."}}