Permutation decoding for the binary codes from triangular graphs
نویسندگان
چکیده
By finding explicit PD-sets we show that permutation decoding can be used for the binary code obtained from an adjacency matrix of the triangular graph T (n) for any n ≥ 5.
منابع مشابه
Non-binary codes associated with triangular graphs, and permutation decoding
Non-binary codes of length ( n 2 ) , dimension n or n − 1, minimum weight n − 1 or 2n − 4, respectively, that can be obtained from designs associated with the complete graph on n vertices and their line graphs, the triangular graphs, are examined. The parameters of the codes and their automorphism groups for any odd prime are obtained and PD-sets inside the symmetric group Sn are found for full...
متن کاملBinary codes from rectangular lattice graphs and permutation decoding
We examine the binary codes obtained from the row span over the field F2 of an adjacency matrix of the rectangular lattice graphs L2(m,n) for 3 ≤ m < n and show that permutation decoding can be used for full error-correction for these codes by finding explicit information sets and PD-sets for these information sets.
متن کاملNew Binary Constant Weight Codes Based on Cayley Graphs of Groups and Their Decoding Methods
We propose a new class of binary nonlinear codes of constant weights derived from a permutation representation of a group that is given by a combinatorial definition such as Cayley graphs of a group. These codes are constructed by the following direct interpretation method from a group: (1) take one discrete group whose elements are defined by generators and their relations, such as those in th...
متن کاملBinary codes from graphs on triples and permutation decoding
We show that permutation decoding can be used, and give explicit PD-sets in the symmetric group, for some of the binary codes obtained from the adjacency matrices of the graphs on ` n 3 ́ vertices, for n ≥ 7, with adjacency defined by the vertices as 3-sets being adjacent if they have zero, one or two elements in common, respectively.
متن کاملCodes associated with triangular graphs and permutation decoding
Linear codes that can be obtained from designs associated with the complete graph onnvertices and its line graph, the triangular graph, are examined. The codes have length n choose 2, dimension n or n − 1, and minimum weight n− 1 or 2n− 4. The parameters of the codes and their automorphism groups for any odd prime are obtained and PD-sets inside the symmetric group Sn are found for full permuta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 25 شماره
صفحات -
تاریخ انتشار 2004