Chapter 6 Modifying Codes If one code is in some sense good, then we can hope to find from it similar and related codes that are also good. In this chapter we discuss some elementary methods for modifying a code in orde

First Page		Document Content
Date: 2012-08-31 11:04:32 Reed–Solomon error correction Linear code Reed–Muller code Cyclic code Generator matrix Euclidean algorithm Plotkin bound Walsh–Hadamard code Coding theory Mathematics Notation		Chapter 6 Modifying Codes If one code is in some sense good, then we can hope to find from it similar and related codes that are also good. In this chapter we discuss some elementary methods for modifying a code in orde Add to Reading List Source URL: www.mth.msu.edu Download Document from Source Website File Size: 158,24 KB 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