{"id":"W1996240237","doi":"10.1109/pimrc.2010.5671869","title":"Construction of new delay-tolerant Space-Time Codes","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block code; Asynchronous communication; Computer science; Construct (python library); Synchronization (alternating current); Luby transform code; Transmission (telecommunications); Linear code; Topology (electrical circuits); Algorithm; Mathematics; Decoding methods; Computer network; Telecommunications; Combinatorics","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.0003018219,0.0002650263,0.0003759291,0.0007261954,0.0004419974,0.0006325332,0.0004410215,0.0004305015,0.0009885799],"category_scores_gemma":[0.001097116,0.0002151176,0.0003973419,0.0004955262,0.0008438826,0.0006236997,0.001019428,0.0008275365,0.0002799573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004453369,"about_ca_system_score_gemma":0.0007655939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003277064,"about_ca_topic_score_gemma":0.0003107411,"domain_scores_codex":[0.9996202,0.00005957982,0.00002766719,0.00005482598,0.0001773787,0.0000602446],"domain_scores_gemma":[0.9993143,0.0001420268,0.0001307738,0.0001406455,0.0001666228,0.0001055245],"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.00006680441,0.00005681265,0.0006246897,0.0000898147,0.00001940592,0.0002469387,0.0002162142,0.03941882,0.02964886,0.8772772,0.001600387,0.05073413],"study_design_scores_gemma":[0.0001247754,0.000400467,0.0006272934,0.00007166382,0.00004373446,0.001096022,0.0001498958,0.4343333,0.08172449,0.4301936,0.05110781,0.0001268537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.200343,0.0006679422,0.7768284,0.0003801815,0.0003164157,0.0001645116,0.0002277132,0.000329261,0.0207426],"genre_scores_gemma":[0.714108,0.0007157978,0.2752036,0.0002220049,0.0001102263,0.0002284239,0.0004087648,0.00006311309,0.008939984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0009885799,"threshold_uncertainty_score":0.003307104,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0215148661804642,"score_gpt":0.2588709355770368,"score_spread":0.2373560693965726,"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."}}