{"id":"W2121793268","doi":"10.1109/twc.2009.071275","title":"On the design of delay-tolerant distributed space-time codes with minimum length","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Decoding methods; Asynchronous communication; Full Rate; Space–time code; Guard (computer science); Transmission (telecommunications); Algorithm; Block code; Telecommunications","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":[],"consensus_categories":[],"category_scores_codex":[0.000436571,0.0002309892,0.0002747673,0.0001493298,0.001046325,0.0001101887,0.003054439,0.0000700601,0.00003418298],"category_scores_gemma":[0.00001249473,0.0001655853,0.00009944288,0.001031752,0.0002824294,0.0002371115,0.00001826408,0.0005228087,0.00004581711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007638544,"about_ca_system_score_gemma":0.0001247861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000746558,"about_ca_topic_score_gemma":0.00003606556,"domain_scores_codex":[0.9980408,0.0007842285,0.0003672957,0.0002676138,0.0002939483,0.0002460955],"domain_scores_gemma":[0.9936275,0.001970848,0.0001796643,0.003860618,0.0002747858,0.00008653988],"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.0003502054,0.004697559,0.000008242354,0.00001284564,0.0004196834,0.000005498897,0.005107913,0.2996348,0.02341888,0.4853441,0.002992791,0.1780075],"study_design_scores_gemma":[0.0007200698,0.0007094605,0.0001687286,0.0002396717,0.00004773883,0.00001565564,0.00009269288,0.9802041,0.01548553,0.001064221,0.0008756291,0.0003765052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005896702,0.0001426794,0.9763061,0.01619728,0.00004132532,0.0004913989,0.00003122239,0.0001839798,0.0007092645],"genre_scores_gemma":[0.9820023,0.001109379,0.01609927,0.0005331172,0.000005424068,0.00009442162,0.00001001677,0.00001347817,0.0001325902],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9761056,"threshold_uncertainty_score":0.8047593,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04196233953191188,"score_gpt":0.2641727135865286,"score_spread":0.2222103740546167,"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."}}