{"id":"W2152519332","doi":"10.1109/isspa.2007.4555406","title":"Lossless source coding using repeat-accumulate codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Lossless compression; Convolutional code; Algorithm; Data compression ratio; Block code; Compression (physics); Code rate; Linear code; Code (set theory); Concatenated error correction code; Theoretical computer science; Data compression; Decoding methods; Image compression; Artificial intelligence; Physics","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.001228402,0.0001550491,0.0001673165,0.0001783593,0.0002008762,0.0001783632,0.0008199061,0.00008002645,0.00001249278],"category_scores_gemma":[0.00009201314,0.0001487395,0.00006603677,0.0004785897,0.00004186935,0.0004305406,0.0004180334,0.0001744347,0.00002047589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001045132,"about_ca_system_score_gemma":0.00003241345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002892119,"about_ca_topic_score_gemma":0.00006527906,"domain_scores_codex":[0.9985368,0.00004069871,0.0002952036,0.000421209,0.0002674898,0.0004385923],"domain_scores_gemma":[0.9987965,0.0002044527,0.0001171054,0.0006825512,0.0001002497,0.00009912657],"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.00005706418,0.0003281816,0.05571099,0.0001161551,0.000103721,0.0005275926,0.008301352,0.003429815,0.3463114,0.1658855,0.002435507,0.4167928],"study_design_scores_gemma":[0.0002503383,0.00008770374,0.001953463,0.0001319211,0.00001150656,0.0002845906,0.0002035273,0.5797339,0.4102184,0.003121358,0.003281273,0.0007220293],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2015734,0.00002245684,0.7884548,0.00006323361,0.0002569254,0.00008838631,1.207657e-7,0.001639024,0.007901709],"genre_scores_gemma":[0.6865858,0.000001779921,0.3126165,0.0002384253,0.00005044169,8.00613e-7,2.232944e-7,0.00001276402,0.0004932546],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5763041,"threshold_uncertainty_score":0.6065422,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04782711716561696,"score_gpt":0.327624385557155,"score_spread":0.279797268391538,"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."}}