New bounds on D-ary optimal codes

نویسندگان
چکیده

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

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

منابع مشابه

New bounds on D-ary optimal codes

We propose a simple method that, given a symbol distribution, yields upper and lower bounds on the average code length of a D-ary optimal code over that distribution. Thanks to its simplicity, the method permits deriving analytical bounds for families of parametric distributions. We demonstrate this by obtaining new bounds, much better than the existing ones, for Zipf and exponential distributi...

متن کامل

On new completely regular q-ary codes

In this paper from q-ary perfect codes new completely regular q-ary codes are constructed. In particular, two new ternary completely regular codes are obtained from ternary Golay [11, 6, 5] code. The first [11, 5, 6] code with covering radius ρ = 4 coincides with the dual Golay code and its intersection array is (22, 20, 18, 2, 1; 1, 2, 9, 20, 22) . The second [10, 5, 5] code, with covering rad...

متن کامل

A note on bounds for q-ary covering codes

Two strongly seminormal codes over 2s are constructed to prove a conjecture of Ostergard. It is shown that a result of Honkala on ( I C , t)-subnormal codes holds also under weaker assumptions. A lower bound and an upper bound on Kq(n, R), the minimal cardinality of a q-ary code of length n with covering radius R are obtained. These give improvements in seven upper bounds and twelve lower bound...

متن کامل

New bounds for n4(k, d) and classification of some optimal codes over GF(4)

Let n4(k; d) be the minimum length of a linear [n; k; d] code over GF(4) for given values of k and d. For codes of dimension "ve, we compute the exact values of n4(5; d) for 75 previously open cases. Additionally, we show that n4(6; 14)=24, n4(7; 9)=18, and n4(7; 10)=20. Moreover, we classify optimal quaternary codes for some values of n and k. c © 2003 Elsevier B.V. All rights reserved.

متن کامل

New 5 - ary and 7 - ary linear codes

Let [n, k, d]q code be a linear code of length n, dimension k and Hamming minimum distance d over GF(q). In this paper record-breaking codes with parameters [30, 10, 15]5, [33, 11, 16]5, [41, 10, 22]5, [24, 14, 8]7, [40, 11, 22]7, [60, 10, 38]7, [60, 13, 34]7, [88, 8, 63]7, [96, 11, 64]7, [96, 13, 61]7 and [96, 15, 58]7 are constructed.

متن کامل

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


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

ژورنال

عنوان ژورنال: Information Processing Letters

سال: 2005

ISSN: 0020-0190

DOI: 10.1016/j.ipl.2005.07.004