Generalized quadratic residue codes

نویسندگان

  • Jacobus H. van Lint
  • F. Jessie MacWilliams
چکیده

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.

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

ثبت نام

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

منابع مشابه

Minimal Distances in Generalized Residue Codes

A general type of linear cyclic codes is introduced as a straightforward generalization of quadratic residue codes, e-residue codes, generalized quadratic residue codes and polyadic codes. A generalized version of the well-known squareroot bound for odd-weight words is derived.

متن کامل

The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes

The structure of the twisted squaring construction, a generalization of the squaring construction, is studied with respect to trellis diagrams and complexity. We show that binary affine-invariant codes, which include the extended primitive BCH codes, and the extended binary quadratic-residue codes, are equivalent to twisted squaring construction codes. In particular, a recursive symmetric rever...

متن کامل

Quadratic Residue Codes and Divisibility

Quadratic residue codes are some of the brightest gems of coding theory. Their facets reeect many topics: quadratic residues and reciprocity; multiply transitive and sporadic simple groups; lattices; group representations; and block designs and Hadamard matrices. They provide the only perfect codes for prime-power sized alphabets correcting more than one error, and some are prototypes of extrem...

متن کامل

On the Minimum Distance of Some Families of Z2k-Linear Codes

With the help of a computer, we obtain the minimum distance of some codes belonging to two families of Z2k -linear codes: the first is the generalized Kerdock codes which aren’t as good as the best linear codes and the second is the Hensel lift of quadratic residue codes. In the latter, we found new codes with same minimum distances as the best linear codes of same length and same cardinality. ...

متن کامل

Asymmetric Quantum Codes: New Codes from Old

In this paper we extend to asymmetric quantum error-correcting codes (AQECC) the construction methods, namely: puncturing, extending, expanding, direct sum and the (u|u + v) construction. By applying these methods, several families of asymmetric quantum codes can be constructed. Consequently, as an example of application of quantum code expansion developed here, new families of asymmetric quant...

متن کامل

Computational Results of Duadic Double Circulant Codes

Quadratic residue codes have been one of the most important classes of algebraic codes. They have been generalized into duadic codes and quadratic double circulant codes. In this paper we introduce a new subclass of double circulant codes, called duadic double circulant codes, which is a generalization of quadratic double circulant codes for prime lengths. This class generates optimal self-dual...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 24  شماره 

صفحات  -

تاریخ انتشار 1978