{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002900719,0.001616609,0.00158643,0.002476169,0.002510113,0.003692767,0.002353129,0.001477861,0.004724554],"category_scores_gemma":[0.02142588,0.000897924,0.001120072,0.003698118,0.004189302,0.00710227,0.007628849,0.005426318,0.001225231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002963911,"about_ca_system_score_gemma":0.001916016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001113741,"about_ca_topic_score_gemma":0.001038636,"domain_scores_codex":[0.9945652,0.0009659132,0.0002758361,0.000758381,0.002097073,0.001337435],"domain_scores_gemma":[0.9731767,0.01830055,0.001664309,0.003755771,0.002140466,0.0009622483],"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.0002408812,0.00007562702,0.001242563,0.0003128814,0.00003714009,0.0002938554,0.0007533724,0.03067462,0.008018508,0.9273922,0.002443568,0.02851488],"study_design_scores_gemma":[0.00004811883,0.0001612124,0.0006912401,0.0002648053,0.00007875823,0.0008405046,0.0003400896,0.1184208,0.01684386,0.846561,0.0156507,0.00009884781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.198605,0.005360805,0.7267873,0.001841421,0.0002010283,0.0001541869,0.0006537237,0.0008845337,0.06551204],"genre_scores_gemma":[0.836192,0.004032346,0.1469622,0.0006696591,0.0004219427,0.0006658452,0.000736505,0.0004558726,0.009863636],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004724554,"threshold_uncertainty_score":0.02150482,"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."}}