Asymptotically optimal linear codes correcting defects of linearly increasing multiplicity (Q2640571)

The author proposes asymptotically optimal linear codes and a method for correcting defects of linearly increasing multiplicitly in a block of length \(n\to \infty\). The method requires O(n log\({}^ 3_ 2n)\) operations for the coding and the decoding procedures and a polynomial number of operations for constructing asymptotically optimal codes with redundancy r(n,t)\(\sim t\).