{"id":"W4385820017","doi":"10.1109/tit.2023.3304712","title":"Constructions and Bounds for Codes With Restricted Overlaps","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Waterloo; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Code word; Prefix; Parity-check matrix; Code (set theory); Mathematics; Discrete mathematics; Combinatorics; Linear code; Block code; Suffix; Binary code; Prefix code; Binary number; Computer science; Algorithm; Arithmetic; Decoding methods; Set (abstract data type)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002876719,0.0001032931,0.00009078164,0.0004746434,0.0005357239,0.0001931434,0.0001724654,0.00005076582,0.00001342085],"category_scores_gemma":[0.000008894312,0.00008997108,0.00005250702,0.0008820544,0.0001332706,0.001344678,0.000001852047,0.0001043674,0.00003487341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001577801,"about_ca_system_score_gemma":0.00004536981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002010116,"about_ca_topic_score_gemma":0.000002622118,"domain_scores_codex":[0.999357,0.00004862404,0.0001801478,0.0001171554,0.0001317857,0.0001652957],"domain_scores_gemma":[0.9991354,0.0004026865,0.00006650109,0.0002468167,0.00008783952,0.00006076881],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000182235,0.00002160151,0.000006527716,0.00002899002,0.00005368658,4.244923e-7,0.001598295,0.002598291,0.00008741001,0.8557175,0.0003261486,0.1393789],"study_design_scores_gemma":[0.006258732,0.002237139,0.001998969,0.000220095,0.0001806886,0.0002666069,0.005480382,0.1051531,0.01815304,0.798769,0.0598539,0.001428365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01528606,0.000003804073,0.9814489,0.0002011316,0.0003350568,0.0002340814,0.000056598,0.0005603732,0.001873991],"genre_scores_gemma":[0.9906488,0.00002940651,0.008713964,0.0002671432,0.00001330614,0.0001518842,0.00001001153,0.000006322329,0.0001591631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9753627,"threshold_uncertainty_score":0.4120409,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008990036429457308,"score_gpt":0.2169207549164129,"score_spread":0.2079307184869556,"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."}}