A Note on an Upper Bound for (n, d)
Journal Title: International Journal for Research in Applied Science and Engineering Technology (IJRASET) - Year 2015, Vol 3, Issue 1
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
- EP ID EP19291
- DOI -
- Views 239
- Downloads 4
Modular Cascaded H-Bridge Multilevel PV Inverter by Using Fuzzy Logic Controller with Distributed MPPT for Grid-Connected Applications
This paper presents a modular cascaded H-bridge multilevel photovoltaic (PV) inverter for single- or three-phase gridconnected applications. The modular cascaded multilevel topology helps to improve the efficiency and fl...
Staff Locating and Notifying System using RFID technology
In global perspective, it is a difficult job to contact human beings in big institutions in spite of the prohibition in mobile network. Presently, global system positioning and Zigbee are employed in locating and tracki...
Power Quality Enhancement in Grid connected Microgrid While Supplying Non-Linear Loads
The objective of the project shows how the power quality can be improved in a microgrid that is supplying a nonlinear load. The microgrid contains a hybrid combination of inertial and converter interfaced distributed ge...
Comparison of Movement Model in DTN using routing algorithm by varying the Nodes
Delay Tolerant Networks (DTNs) represent a class of wireless networks that experience frequent and long lasting partitions due to dense distribution of nodes in the network topology. In DTN the routing of packets is mad...
Factors Influencing Customer Satisfaction & Customer Delight in Fine Dining Restaurants
Motivation and Problem Statement In a competitive marketplace, particularly the QSRs and Fine Dining Restaurants segment, businesses are facing increased competition from each other. In this hypercompetitive environment...