{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007970153,0.0003608523,0.0003341681,0.0003920101,0.001848703,0.0002925849,0.007169632,0.000165917,0.00003661964],"category_scores_gemma":[0.00002664722,0.0003390504,0.0001523102,0.001340234,0.0007714449,0.0009228486,0.00009238387,0.001858854,0.0001574378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009913056,"about_ca_system_score_gemma":0.0002565797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000662108,"about_ca_topic_score_gemma":0.01199063,"domain_scores_codex":[0.9975872,0.0006997507,0.0004908285,0.000527799,0.0002708899,0.0004235382],"domain_scores_gemma":[0.9867641,0.001750776,0.0002610941,0.01057826,0.0004460178,0.000199771],"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.0004366622,0.01119456,0.001076887,0.0001003526,0.001403803,0.00002336447,0.02395855,0.008241239,0.1440481,0.6109691,0.006160044,0.1923874],"study_design_scores_gemma":[0.001955203,0.001537836,0.00232109,0.0004574994,0.0003105366,0.0001702961,0.001078711,0.8127223,0.1267896,0.02155592,0.02849341,0.002607645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002791367,0.00006686071,0.9749153,0.007307992,0.0003421712,0.0006534911,0.00005945251,0.001637969,0.01222537],"genre_scores_gemma":[0.686495,0.0001862391,0.3121679,0.0002667798,0.00001123252,0.0004384092,0.00001288188,0.00003625986,0.0003852342],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.804481,"threshold_uncertainty_score":0.9999061,"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."}}