For every linear code of length n and encoded coordinate i, the expected uniform-with-replacement recovery reads satisfy a_i(C)+a_i(C⊥)=n under the time-zero convention; therefore C is recovery balanced exactly when its dual is.
For every linear code of length n and encoded coordinate i, the expected uniform-with-replacement recovery reads satisfy a_i(C)+a_i(C⊥)=n under the time-zero convention; therefore C is recovery balanced exactly when its dual is.
For every linear code of length n and encoded coordinate i, the expected uniform-with-replacement recovery reads satisfy a_i(C)+a_i(C⊥)=n under the time-zero convention; therefore C is recovery balanced exactly when its dual is.
If correct, settles a stated coding-theory conjecture by a coordinatewise expectation identity.
Is a linear code recovery balanced if and only if its orthogonal dual is recovery balanced?
Publication dates and editorial changes.
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
