2 problems

Let a codeword have a given length, and let errors be introduced into it before correction. The error-ratio conjecture. The ratio of errors in the codeword is more closely related…

Let $VT_{(a,b)}(n;4)$ be a quaternary Varshamov–Tenengolts code, let $\phi$ be a Naisargik map, and let $D_1(X)$ denote the set of binary sequences obtained from $X$ by one deletio…