ARCHIVES

Research Article

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

KHARVI SANDEEP1

¹² Asst Prof, Dept. of mathematics, Sai Vidya Institute of Technology, Karnataka, India.

Published Online: September-October 2021

Pages: 10-11

Cite this article

No DOI
Check for updates unavailable

Abstract

View PDF

Abstract: In this correspondence, we really want to get an upper bound for the value of (n,d), we have associated with the bounds on the number of code words in linear code Coflengthn. In particular we have given the exact in equality for (n,d).

Related Articles

2021

Hybrid Distributed Generation System: A Novel Reflexive Islanding Detection Method under Composed Islanding Condition

2021

Enhanced Disturbance with Droop Mechanism for Facts Based PV System

2021

Investigation of Parching Kinetics and Superiority of Indian Red Chilli In Solar Hybrid Greenhouse Drying And Open Sun Drying

2021

Scheme of Squat Power, High Speed Fine Grain and Coarse Grain Twin Tail Comparator

2021

Liability Diagnosis with a Novel Cluster Setup for WSNS by Dag Arrangement Using of Log Files in Internet of Things

2021

Performance Analysis of BLDC by using Fuzzy Logic Controller to Control Indirect Flux and Torque

2021

Investigation of Cattle Dung Ash as Adsorbent for Wastewater Management Systems

2021

Performance analysis of PLA SpendingQuantum Dot Cellular Automata

2021

Significance of Shell & Tube Heat Exchangers In candy plants

2021

Investigation of a 3-Phasesquirrel cage induction motor and Brushless DC Motor Using MAT Lab