On majority-logic-decodable arithmetic codes

From MaRDI portal





The binary cyclic arithmetic code of length \(n\) generated by the integer \[ A=(2^n-1)/[(2^{n_1}-1)(2^{n_2}-1)],\quad n=n_1n_2, (n_1,n_2)=1, n_1<n_2 \] is shown to have minimum arithmetic distance of \(n_1\). A two-step majority-logic decoding algorithm for these codes is given which is guaranteed to correct all errors up to the minimum distance if \(n_2>(2n_1-1)\) and will correct some errors if this condition is not met. Let \(n\) be an integer divisible by precisely the distinct primes \(p_i\), \(i=1,\ldots,L\) which satisfy the condition \(p_i\geq 2^{i-1}(p_i-1)+1\), \(i=2,3,\ldots,L\). If \(Q^n(x)\) is the \(n\)th cyclotomic polynomial, then the arithmetic code of length \(n\) generated by \(Q^n(2)\) has minimum distance exactly \(p_i\) and can be majority-logic decoded up to \([(p_i-1)/2]\) errors in exactly \(L\) steps.











This page was built for publication: On majority-logic-decodable arithmetic codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5685938)