PROJECT TITLE :
On the Minimum Redundancy of SEC-DAEC-TAEC Binary Linear Block Codes
The redundancy n - k of an (n, k) binary linear block code capable of single error correction, double adjacent error correction and triple adjacent error correction (SEC-DAECTAEC) is lower bounded by log2(3n - two). Recently, researchers have tried to seek out minimum redundancy codes which achieve equality during this lower sure using laptop search and failed. In this letter, we have a tendency to prove that such codes don't exist for any n and k. This results in the tighter lower sure of n - k ≥ log2(3n - 1) on the redundancy of SEC-DAEC-TAEC codes.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here