• A NOTE ON SOME ELEMENTARY BOUNDS ON CODES

AVINASH J. KAMBLE*, T. VENKATESH

Abstract


In this paper, we will discuss certain limitations of codes in the form of upper and lower bounds on the rate of codes as a function of their relative distance. Further we will give concrete bounds on the size of codes and then infer as corollaries the asymptotic statement for code families relating rate and relative distance.


Keywords


Linear codes, Optimal code, Minimum distance, Rate and Relative distance of a code, Entropy function.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2011-2019 Research Journal of Pure Algebra (RJPA)
Copyright Agreement & Authorship Responsibility
HTML Counter
Counter