Efremenko and Zamir introduce a variant of error correcting codes (ECC) with no predetermined length. An unbounded ECC with rate R and distance ε is an encoding of a (possibly infinite) message into a (possibly infinite) codeword, such that for every large enough k we may recover the first Rk symbols of the message from the first k symbols of the codeword. In this talk, we study the performance of linear codes in the unbounded setting.
