<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.devclub.in/index.php?action=history&amp;feed=atom&amp;title=MTL744</id>
	<title>MTL744 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.devclub.in/index.php?action=history&amp;feed=atom&amp;title=MTL744"/>
	<link rel="alternate" type="text/html" href="https://wiki.devclub.in/index.php?title=MTL744&amp;action=history"/>
	<updated>2026-04-09T06:00:57Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.45.1</generator>
	<entry>
		<id>https://wiki.devclub.in/index.php?title=MTL744&amp;diff=1642&amp;oldid=prev</id>
		<title>Prashantt492: Creating course page via bot</title>
		<link rel="alternate" type="text/html" href="https://wiki.devclub.in/index.php?title=MTL744&amp;diff=1642&amp;oldid=prev"/>
		<updated>2026-03-04T10:14:44Z</updated>

		<summary type="html">&lt;p&gt;Creating course page via bot&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Infobox Course&lt;br /&gt;
| code = MTL744&lt;br /&gt;
| name = Mathematical Theory of Coding&lt;br /&gt;
| credits = 3&lt;br /&gt;
| credit_structure = 3-0-0&lt;br /&gt;
| pre_requisites = MTL105/MTL501&lt;br /&gt;
| overlaps = ELL710&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
== MTL744 : Mathematical Theory of Coding ==&lt;br /&gt;
Review of communication channels, maximum likelihood and nearest neighbour decoding schemes, Hamming distance, Distance of a code. Structure of finite fields,Linear codes and their duals, Equivalence of linear codes, encoding with a linear code, decoding of a linear code, ISBN Code, Hamming codes. Hadamard matrix codes, Golay codes, Codes and Latin squares. Non-linear codes, Nordstrom-Robinson code, Kerdock codes, Preparata codes. Bounds in coding theory: Sphere-covering bound, Hamming bound and perfect codes, Singleton bound and MDS codes, Gilbert-Varshamov bound, Plotkin bound, Griesmer bound. Weight enumerators, MacWilliams Identity. Construction of new codes: Propagation rules, Reed-Muller codes, subfield codes. The structure of cyclic codes, encoding and decoding with a cyclic code, minimal codes, Some special cyclic codes including BCH codes and their decoding algorithm, Reed-Solomon codes, quadratic residue codes. Burst errors, Burst error-correcting codes, decoding of cyclic burst-error-correcting codes. Generalized Reed-Solomon codes, Alternant codes, Goppa codes, Sudan decoding for generalized RS codes.&lt;/div&gt;</summary>
		<author><name>Prashantt492</name></author>
	</entry>
</feed>