… The overall structure of our codes is related to the low-density parity-check codes introduced
… to the codes introduced in [25] for error correction. Because we examine the erasure setting, …

… We will refer to (17) as the erasure bound for vector codes. Note that … Lemma 3.4: Any
exact-repair MBR code is optimal with respect to the erasure bound and has quasi-dimension κ = k…

… codes by providing their parity-check matrices. We will then give the erasure-correcting
capability of the codes … array and the row-wise vector structure of the code throughout the paper. …

… , etc., erasure correction codes with low decoding delays are … focused on codes designed
to maximize burst error-correcting … In contrast, we consider codes for burst erasure correction …

… correction, one may in fact interpret p-secure codes as private codes designed for erasure
correction… in comparison to private codes is the additional requirement that the code is also …

… code can be combined with traditional error-correction codes in order to obtain a (suboptimal)
multiple-description code… delayless erasure codes for control over digital erasure channels…

… For multiple burst erasure correcting codes we define the efficiency of a code which can … a
binary t-erasure correcting code is not sufficient; we require as well that the base code can be …

… Proof: We derive a lower bound on the minimum distance of the code, which equals the
upper bound of Theorem 2. In particular, we show that erasure correction is possible from an …

… Correction (FEC) techniques can be used, consisting in the transmission of redundant packets
(based on error correcting codes) … Despite the widespread use of error correcting codes in …

… coding exponent. We derive the erasure correcting capacity of long binary BCH codes with
… Concatenated codes of growing length n --* 0o and polynomial decoding complexity O(n2), …