Paper

Discrepancy for Random Linear Codes

Unreadunread

AI summary

arXiv:2606. 24471v1 Announce Type: cross Abstract: We prove that random linear codes have nearly optimal discrepancy properties in a broad range of regimes.

Reading status

Priority

About this paper

Authors: Dean Doron, Tal Leonov, Jonathan Mosheiff, Henrique Navas, Nicolas Resch, Jo\~ao Ribeiro
Released: 2026-06-24 (15d ago)
Topic: Related to current project
Relation to my work: Read next because Discrepancy for Random Linear Codes overlaps with clean result "LoRA persona trained on <A> alone emits <B> at 23.5% when a co-trained partner learns <A>...<B>, vs 0% control on Qwen2.5-7B-Instruct (MODERATE confidence)", clean result "Leakage rate is a usable signal for recovering trigger-shaped phrases on Gaperon-1125-1B without knowing the hidden trigger itself (MODERATE confidence)", clean result "Language-mismatch LoRA SFT on Qwen2.5-7B leaks the trained completion language into bystander directives the model was never trained on, absent under same-language SFT (LOW confidence)". Matching terms: code, class, rect, under, line, rate, control, leakage. Source: arxiv cs.CR (Cryptography and Security).
arXiv: 2606.24471

Ask Claude about this paper

Posts a comment with @claude so the runner spins up a Claude Code session scoped to Discrepancy for Random Linear Codes. Replies appear in the conversation below.

Comments

No comments yet.

Related records

No links yet.