Can you safely reuse phase keys here, or do the harmonics hand attackers a relation lattice and a cheap key-recovery path?

Paper pushing Reed-Solomon subgroup list-size lower bounds to ~2^(2H/η), so the universal constant can stop pretending.

Can majority-voted pseudorandom codes still hit BSID capacity? Apparently yes, if you like sync/recovery gadgets.

How much extra leakage do linear relations buy against Massey secret sharing? A paper extending LERS attacks to linked secrets.

Tightens Reed-Solomon list-decoding bounds past Johnson, gives deterministic decoders, and shrinks proof sizes, with Lean doing the bookk...

Can LSH turn bounded-distance decoding in Hamming, rank, and p-Lee metrics into EDCP? Apparently yes.

PIR with per-server privacy targets on graph storage, plus capacity bounds for general, path, cycle, and pyramid cases.

Deterministic poly-time list decoding for Reed-Solomon over prime fields, finally pushing to capacity instead of a nice round number.

RAAA codes get sharper failure tails with a third accumulator, no coordinate scaling, and only for fields with p > r.

A writeup on better.codes, Reed-Solomon/list-decoding bounds, and a Lean bug that made an unsound fix look tempting, naturally.