Ternary Constant Weight Codes

نویسندگان

  • Patric R. J. Östergård
  • Mattias Svanström
چکیده

Let A3(n, d,w) denote the maximum cardinality of a ternary code with length n, minimum distance d, and constant Hamming weight w. Methods for proving upper and lower bounds on A3(n, d,w) are presented, and a table of exact values and bounds in the range n ≤ 10 is given.

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

ثبت نام

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

منابع مشابه

New Ternary and Quaternary Equidistant Constant Weight Codes

We consider the problem of finding bounds on the size of ternary and quaternary equidistant constant weight codes. We present a computer realization of an algorithm for solving the maximum clique problem. We use it for finding the exact values of the maximum size for ternary and quaternary equidistant constant weight codes for all open cases for n ≤ 10 are found.

متن کامل

On diameter perfect constant-weight ternary codes

From cosets of binary Hamming codes we construct diameter perfect constantweight ternary codes with weight n − 1 (where n is the code length) and distances 3 and 5. The class of distance 5 codes has parameters unknown before.

متن کامل

Optimal ternary constant-composition codes with weight four and distance six

The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem of constructing optimal ternary constant-composition codes with Hamming weight four and minimum distance six. The problem is solved with a small number of len...

متن کامل

Enumeration of some optimal ternary constant-weight codes

We consider the problem of classification of optimal ternary constantweight codes. We use combinatorial and computer methods to find inequivalent codes for some cases for 3 ≤ d ≤ n ≤ 9.

متن کامل

On Perfect Ternary Constant Weight Codes

We consider the space of ternary words of length n and fixed weightwwith the usual Hamming distance. A sequence of perfect single error correcting codes in this space is constructed. We prove the nonexistence of such codes with other parameters than those of the sequence.

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Electr. J. Comb.

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2002