{"id":"W2790037810","doi":"10.1109/tcomm.2018.2816070","title":"Index Mapping for Bit-Error Resilient Multiple Description Lattice Vector Quantizer","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Voronoi diagram; Algorithm; Decoding methods; Binary number; Coset; Hamming distance; Computer science; Lattice (music); Error detection and correction; Hamming bound; Mathematics; Binary erasure channel; Topology (electrical circuits); Channel (broadcasting); Theoretical computer science; Discrete mathematics; Hamming code; Block code; Combinatorics; Channel capacity; Arithmetic; Geometry; 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.000299765,0.0001916038,0.0001810143,0.0003265573,0.001154568,0.0001339942,0.002426726,0.0001083607,0.00002107516],"category_scores_gemma":[0.00005220989,0.0001974396,0.0001180623,0.0006661508,0.0002322041,0.0009491874,0.00004339547,0.0003202147,0.00009282918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001284501,"about_ca_system_score_gemma":0.00006966582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007889108,"about_ca_topic_score_gemma":0.0003575914,"domain_scores_codex":[0.998458,0.0001748988,0.0004033275,0.0004328156,0.0002288387,0.000302071],"domain_scores_gemma":[0.9949626,0.0007016716,0.0001582255,0.003717761,0.0003510429,0.0001087284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005927851,0.006988388,0.0004616875,0.0002216743,0.0004756209,0.000004150801,0.01017814,0.005795993,0.2915019,0.1278095,0.0336079,0.5223622],"study_design_scores_gemma":[0.00109685,0.0003690888,0.001128017,0.0002209187,0.00003209686,0.00001345035,0.0001949634,0.7729312,0.09574584,0.00797552,0.119688,0.0006041497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009361152,0.00006553625,0.9943663,0.002111779,0.0005036814,0.0007289679,0.00008368102,0.0008328485,0.0003710383],"genre_scores_gemma":[0.589029,0.00007023549,0.409958,0.0002346496,0.00002560786,0.0004115315,0.00001001929,0.00001761116,0.0002433],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7671351,"threshold_uncertainty_score":0.8880123,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1086104429415533,"score_gpt":0.3431401829890115,"score_spread":0.2345297400474582,"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."}}