An Asymptotic Formula in <inline-formula> <tex-math notation="TeX">\(q\) </tex-math></inline-formula> for the Number of <inline-formula> <tex-math notation="TeX">\([n, k]~q\) </tex-math></inline-formula>-Ary MDS Codes

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An asymptotic formula in q for the number of [n, k] q-ary MDS codes

We obtain an asymptotic formula in q for the number of MDS codes of length n and dimension k over a finite field with q elements.

متن کامل

MathML formatting with TEX rules , TEX fonts , and TEX quality ∗

In this paper we investigate the architecture of a MathML formatting engine based on an abstraction of the TEX box primitives. This engine is carefully designed so that the TEX-dependent formatting rules are isolated from the independent ones and is capable of achieving TEX-comparable output quality when used in conjunction with TEX fonts. We show how the formatting rules presented in Appendix ...

متن کامل

An asymptotic formula in additive number theory

1 . Introduction . In his paper [1], Erdös introduced the sequences of positive integers b 1 < b, < . . ., with (b ;, bj ) = 1, for i ~A j, and 'bi 1 < oo . With any such arbitrary sequence of integers, he associated the sequence {di} of all positive integers not divisible by any bj , and he showed that if b1 > 2, there exists a 0 < 1 (independent of the sequence {b i }) such that d i 1 di < d°...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2014

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2014.2349903