• A NOTE ON SOME ELEMENTARY BOUNDS ON CODES
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
Full Text:
PDFRefbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2011-2024 Research Journal of Pure Algebra (RJPA) Copyright Agreement & Authorship Responsibility | Counter |