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

PROJECT TITLE :An Ant Colony Optimization Based Approach for Minimum Cost Coverage on 3-D Grid in Wireless Sensor Networks - 2018ABSTRACT:The application of swarm intelligence algorithms to wireless sensor networks (WSNs) deployment
PROJECT TITLE :An Algorithm for Finding the Minimum Cost of Storing and Regenerating Datasets in Multiple Clouds - 2018ABSTRACT:The proliferation of cloud computing allows users to flexibly store, re-compute or transfer large
PROJECT TITLE :Cascaded multilevel inverter using series connection of novel capacitor-based unitswith minimum switch count - 2016ABSTRACT:This paper presents a new family of cascaded multilevel inverters (CMLIs) that will generate
PROJECT TITLE :Optimisation for offshore wind farm cable connection layout using adaptive particle swarm optimisation minimum spanning tree methodABSTRACT:The wind farm layout optimisation downside is similar to the classic mathematical
PROJECT TITLE :Accurate range profile alignment method based on minimum entropy for inverse synthetic aperture radar image formationABSTRACT:Accurate range profile alignment is an important step for achieving the following azimuth

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry