In this paper, we investigate erasure-resilient codes (ERC) coming from Steiner 2-designs with block size k which can correct up to any k erasures.

In this paper, we investigate erasure-resilient codes coming from Steiner 2-designs with block size k which can correct up to any k erasures.

Erasure-resilient codes from affine spaces. Müller, M.; Jimbo, M. Discrete Applied Mathematics 143(1-3): 292-297. ISSN: 0166-218X. 2004 ...

Erasure-Resilient Codes from Affine Spaces. Müller M, Masakazu J (2004). Publication Type: Journal article. Publication year: 2004. Journal. Discrete Applied ...

May 24, 2012 · Originally, erasure-resilient codes were introduced for RAID (redundant array of independent disks) and similar storage systems. They are ...

In this paper, we take a set systems view of the problem of constructing erasure-resilient codes. This leads to interesting extremal problems in finite set ...

Jan 18, 2016 · Abstract—We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under ...

In this paper, we investigate erasure-resilient codes coming from Steiner 2-designs with block size k which can correct up to any k erasures. In view of ...

Mar 12, 2024 · We show that the known list-decoding algorithms for univariate multiplicity and folded Reed-. Solomon (FRS) codes can be made to run in ...

In this paper, we investigate erasure-resilient codes coming from Steiner 2-designs with block size k which can correct up to any k erasures. In view of ...