794 IEEETRANSACTIONS [I41 T. Kasami, S. Lin, and W. W. Peterso?,.“New generalizations of the Reed-Muller codes-Part I: Pritnltlve codes,” IEEE Trans.

First Page		Document Content
Date: 2012-04-16 01:14:54 Mathematics Error detection and correction Finite fields Invariant theory Enumerator polynomial Cyclic code Molien series Quadratic residue code BCH code Coding theory Abstract algebra Algebra		794 IEEETRANSACTIONS [I41 T. Kasami, S. Lin, and W. W. Peterso?,.“New generalizations of the Reed-Muller codes-Part I: Pritnltlve codes,” IEEE Trans. Add to Reading List Source URL: neilsloane.com Download Document from Source Website File Size: 1,68 MB Share Document on Facebook

	Quantum Cyclic Code of length dividing pt + 1 Sagarmoy Dutta∗ Piyush P Kurur Dept of Computer Science and Engineering DocID: 1qLvC - View Document
	Some recent progress on cyclic codes Tao Feng () Department of Mathematics, Zhejiang University Fq11, Otto-von-Guericke University Magdeburg, July 23, 2013 DocID: 1qCnj - View Document
	ISSN No: International Journal & Magazine of Engineering, Technology, Management and Research A Peer Reviewed Open Access International Journal DocID: 1qvWR - View Document
	Weight Distribution of Linear Error Correcting Codes Chaos Golubitsky Abstract In this paper, i will discuss a class of error-correcting codes known as BCH codes. I will give a DocID: 1pILU - View Document
	Computing the minimal distance of cyclic codes Jos´ e Felipe Voloch Abstract: We describe an algorithm that improves on the standard algorithm for computing the minimal distance of cyclic codes. Keywords: cyclic codes, DocID: 1p3uS - View Document