Defect-correcting codes (Q1310748)

The paper deals with a class of \(q\)-ary error-correcting codes. The codes belong to additive codes of length \(N\), allowing to correct \(t\) defects. The author shows that the problem of finding a code becomes equivalent to construction of a certain matrix \(A(t, N, M)\) with the following properties: 1) Any of its \(t\) columns create rows with all \(2^ t\) binary vectors; 2) It consists of \(r= r(t,N)\) columns that create a submatrix including, as its rows, all different sequences, where parameter \(r\) describes the overhead of a code correcting \(t\) defects. The author proposes an iterative algorithm leading to construction of additive codes with required properties.