{"id":"W2774323520","doi":"10.1109/tit.2017.2779851","title":"Streaming Codes for Multiplicative-Matrix Channels With Burst Rank Loss","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Erasure code; Computer science; Rank (graph theory); Multiplicative function; Channel (broadcasting); Binary erasure channel; Erasure; Communication source; Matrix (chemical analysis); Algorithm; Discrete mathematics; Mathematics; Channel capacity; Decoding methods; Combinatorics; Computer network","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001038951,0.0006067108,0.000389506,0.0005438357,0.0004564282,0.0007625271,0.0006308411,0.0005565741,0.001603523],"category_scores_gemma":[0.005974955,0.0002369028,0.0003017391,0.0007034437,0.001104877,0.001585104,0.001163045,0.00111738,0.0002679514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008037841,"about_ca_system_score_gemma":0.001082562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001398353,"about_ca_topic_score_gemma":0.001379598,"domain_scores_codex":[0.9992592,0.0002612134,0.00003421307,0.00007045411,0.0002465461,0.0001283925],"domain_scores_gemma":[0.9949601,0.002865952,0.0006932277,0.0005164254,0.0007609472,0.0002032651],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002573,0.00006418046,0.0007797238,0.0001187788,0.00002343869,0.0002091862,0.0001758921,0.5244095,0.01247148,0.4169092,0.001789486,0.04279177],"study_design_scores_gemma":[0.00001414433,0.00008142854,0.0001377734,0.00001441677,0.000005445258,0.0001222101,0.00003169511,0.9171513,0.003208221,0.07826535,0.0009488826,0.00001906568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1226662,0.0005231473,0.8705978,0.0003542336,0.00004753914,0.00007828168,0.0001663395,0.0002159426,0.005350419],"genre_scores_gemma":[0.8820146,0.0006588071,0.1129952,0.0001502998,0.00009272426,0.0001299266,0.0002012528,0.00005637909,0.003700795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001603523,"threshold_uncertainty_score":0.005831897,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02467103453853499,"score_gpt":0.2913047066467689,"score_spread":0.2666336721082339,"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."}}