{"id":"W3041773245","doi":"10.1109/tit.2020.3008973","title":"Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Research in Fundamental Sciences","keywords":"Low-density parity-check code; Fading; Decoding methods; Lattice (music); List decoding; Algorithm; Computer science; Binary number; Algebraic structure; Mathematics; Block code; Theoretical computer science; Topology (electrical circuits); Concatenated error correction code; Combinatorics; Arithmetic; Pure mathematics; Physics","routes":{"ca_aff":true,"ca_fund":true,"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.0009329693,0.0001874275,0.000253586,0.0002710193,0.0005958023,0.0002057777,0.0003726708,0.0001637767,0.00001462978],"category_scores_gemma":[0.00006461203,0.0001992336,0.0001013161,0.000212776,0.0001067671,0.001300298,0.00007903893,0.0004445922,0.000007596755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006764646,"about_ca_system_score_gemma":0.0001292491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001404537,"about_ca_topic_score_gemma":8.303118e-7,"domain_scores_codex":[0.9987124,0.0002854548,0.0004439244,0.0002140701,0.0001981668,0.0001459662],"domain_scores_gemma":[0.9977666,0.001056501,0.0004218615,0.0003692865,0.0002985306,0.00008723766],"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.0008582586,0.000142324,0.000003167926,0.0007451197,0.0004670716,0.000001341096,0.03901762,0.4106497,0.0009674082,0.2018718,0.000347378,0.3449288],"study_design_scores_gemma":[0.0006516755,0.0001790357,0.000004640328,0.0002077527,0.00008739496,0.00003746077,0.0004658033,0.974157,0.009216205,0.01435218,0.0003418431,0.0002990058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001200811,0.00003646552,0.995838,0.001071716,0.0007975479,0.0007179347,0.00001895023,0.0001454295,0.0001731259],"genre_scores_gemma":[0.774019,0.0004418651,0.2251575,0.0002617015,0.00002450525,0.00007454924,0.000005671562,0.000006023422,0.000009168069],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7728182,"threshold_uncertainty_score":0.8124511,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07568244227812168,"score_gpt":0.2984073980971861,"score_spread":0.2227249558190644,"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."}}