A Method to determine Partial Weight Enumerator for Linear Block Codes

نویسندگان

  • Saïd Nouh
  • Bouchaib Aylaj
  • Mostafa Belkasmi
چکیده

In this paper we present a fast and efficient method to find partial weight enumerator (PWE) for binary linear block codes by using the error impulse technique and Monte Carlo method. This PWE can be used to compute an upper bound of the error probability for the soft decision maximum likelihood decoder (MLD). As application of this method we give partial weight enumerators and analytical performances of the BCH(130,66) , BCH(103,47) and BCH(111,55) shortened codes; the first code is obtained by shortening the binary primitive BCH (255,191,17) code and the two other codes are obtained by shortening the binary primitive BCH(127,71,19) code. The weight distributions of these three codes are unknown at our knowledge.

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

ثبت نام

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

منابع مشابه

Genetic algorithms for finding the weight enumerator of binary linear block codes

In this paper we present a new method for finding the weight enumerator of binary linear block codes by using genetic algorithms. This method consists in finding the binary weight enumerator of the code and its dual and to create from the famous MacWilliams identity a linear system (S) of integer variables for which we add all known information obtained from the structure of the code. The knowl...

متن کامل

Computing Symmetrized Weight Enumerators for Lifted Quadratic Residue Codes

The paper describes a method to determine symmetrized weight enumerators of Zpm -linear codes based on the notion of a disjoint weight enumerator. Symmetrized weight enumerators are given for the lifted quadratic residue codes of length 24 modulo 2 and modulo 3 , for any positive m .

متن کامل

A Note on Weight Enumerators of Linear Self-dual Codes

A partial description of (complete) weight enumerators of linear self-dual codes is given. 0. Let F = Z/pZ, where p is a prime number. If C is a linear code on F of length n, i.e., a linear subspace in Fn, then its (complete) weight enumerator WC is defined to be

متن کامل

Complete Weight Enumerator of a Family of Linear Codes from Cyclotomy

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for a prime p, we determine the explicit complete weight enumerators of a family of linear codes over Fp with defining set related to cyclotomy. These codes may have applications in cryptography and secret sharing schemes. Index Terms Linear code, complete weight enumerator, cyclotomy, Gaussia...

متن کامل

Quantum Weight Enumerators

In a recent paper, Shor and Laflamme define two “weight enumerators” for quantum error-correcting codes, connected by a MacWilliams transform, and use them to give a linear-programming bound for quantum codes. We introduce two new enumerators which, while much less powerful at producing bounds, are useful tools nonetheless. The new enumerators are connected by a much simpler duality transform, ...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • CoRR

دوره abs/1212.6086  شماره 

صفحات  -

تاریخ انتشار 2012