Sell Your Projects | My Account | Careers | This email address is being protected from spambots. You need JavaScript enabled to view it. | Call: +91 9573777164

On the Minimum Redundancy of SEC-DAEC-TAEC Binary Linear Block Codes

1 1 1 1 1 Rating 4.90 (70 Votes)

PROJECT TITLE :

On the Minimum Redundancy of SEC-DAEC-TAEC Binary Linear Block Codes

ABSTRACT:

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


On the Minimum Redundancy of SEC-DAEC-TAEC Binary Linear Block Codes - 4.9 out of 5 based on 70 votes

Project EnquiryLatest Ready Available Academic Live Projects in affordable prices

Included complete project review wise documentation with project explanation videos and Much More...