{"id":"W2094116203","doi":"10.1109/tcomm.2010.092810.090549","title":"Adaptive Discrete-Rate MIMO Communications with Rate-Compatible LDPC Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Division of Electrical, Communications and Cyber Systems; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"MIMO; Link adaptation; Low-density parity-check code; Computer science; Code rate; Spectral efficiency; Adaptive coding; Communications system; Wireless; Bit error rate; Throughput; Coding (social sciences); Electronic engineering; Algorithm; Channel (broadcasting); Real-time computing; Computer network; Decoding methods; Mathematics; Telecommunications; Fading; Engineering","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.00048608,0.0005253855,0.000362621,0.0003748333,0.0003718852,0.0006116104,0.0007638293,0.0004718607,0.0006522586],"category_scores_gemma":[0.002224966,0.0002167002,0.0002216323,0.0005800845,0.0006403017,0.0006585961,0.0006350118,0.0006892144,0.000337276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004447751,"about_ca_system_score_gemma":0.0005670037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009183153,"about_ca_topic_score_gemma":0.001149112,"domain_scores_codex":[0.9993399,0.0002186156,0.00003117634,0.00009436299,0.0002547351,0.00006118029],"domain_scores_gemma":[0.9989488,0.0004489592,0.000163758,0.0001859809,0.0002132334,0.00003925669],"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.0006198514,0.00021824,0.002470863,0.0003836739,0.0001082132,0.0008415191,0.0004350851,0.4918301,0.2008398,0.143825,0.002694163,0.1557334],"study_design_scores_gemma":[0.00008446687,0.0002260442,0.0004184527,0.00002658765,0.00004002425,0.0003558468,0.00002530577,0.9258895,0.05134084,0.01686606,0.004674686,0.0000522417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05369742,0.0003883516,0.9403193,0.0002433951,0.00006264031,0.00009095096,0.00007296902,0.0004575668,0.004667435],"genre_scores_gemma":[0.7848743,0.0004337338,0.2115235,0.0001528417,0.00008552967,0.0001570896,0.00007698379,0.00002365498,0.002672453],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0009183153,"threshold_uncertainty_score":0.003227055,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03968022538419889,"score_gpt":0.298442293113083,"score_spread":0.2587620677288841,"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."}}