A Note on an Upper Bound for (n, d)

Abstract

In this correspondence, we have to obtain an upper bound for the value of (n,d), we have related to the bounds on the number of code words in a linear code C of length n. In particular we have given the exact inequality for (n, d).

Authors and Affiliations

Dr. M. Mary Jansi Rani, P. Komala Valli

Keywords

Related Articles

Wind Energy Power System Simulation for a Remote Area Power Supply

This work focuses on the designing and analysis of a wind energy power system for a Remote Area Power Supply (RAPS). The system introduces a three phase ac-ac converter with an isolated high frequency-link for a wind en...

Vehicle Automation using Voice Recognizer

our project is about vehicle automation, as we can see the world is been digitized or automated and our vehicles should also be automated and henceforth we are working on an project on voice recognition, so that the veh...

A Review on Wearable Hand Gloves Gesture for Disabled People

A gesture is used to classify and recognize a signal that enables communication among the disabled person. It is a technique that can be use to make people feel convenient similar to the behavior of normal people. In th...

Use of Renewable Energy Sources in Construction of Green Building

This paper mainly aims towards the green building concept which includes the renewable sources used for the construction. The green building concept is very much useful in keeping the environment clean which on a certai...

Review Paper on ph Transmitter Showing Control Functionality

pH is short form for the Power (p) of Hydrogen (H). pH is defined as the negative log of the Hydrogen activity, aH+ or the effective ion concentration. pH is a unit of measure which describes the degree of acidity or al...

Download PDF file
  • EP ID EP19291
  • DOI -
  • Views 263
  • Downloads 4

How To Cite

Dr. M. Mary Jansi Rani, P. Komala Valli (2015). A Note on an Upper Bound for (n, d). International Journal for Research in Applied Science and Engineering Technology (IJRASET), 3(1), -. https://europub.co.uk/articles/-A-19291