<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=Zigzag_code</id>
	<title>Zigzag code - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=Zigzag_code"/>
	<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=Zigzag_code&amp;action=history"/>
	<updated>2026-05-15T10:20:09Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.32.0</generator>
	<entry>
		<id>http://en.zaoniao.it/index.php?title=Zigzag_code&amp;diff=1177&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;In coding theory, a '''zigzag code''' is a type of linear error-correcting code introduced by. They are defined by partitioning the input data into segments of fixed size,...&quot;</title>
		<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=Zigzag_code&amp;diff=1177&amp;oldid=prev"/>
		<updated>2019-02-26T05:56:10Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;In &lt;a href=&quot;/Coding_theory&quot; title=&quot;Coding theory&quot;&gt;coding theory&lt;/a&gt;, a &amp;#039;&amp;#039;&amp;#039;zigzag code&amp;#039;&amp;#039;&amp;#039; is a type of linear error-correcting code introduced by. They are defined by partitioning the input data into segments of fixed size,...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;In [[coding theory]], a '''zigzag code''' is a type of linear error-correcting code introduced by. They are defined by partitioning the input data into segments of fixed size, and adding sequence of check bits to the data, where each check bit is the exclusive or of the bits in a single segment and of the previous check bit in the sequence.&lt;br /&gt;
 &lt;br /&gt;
The code rate is high: where is the number of bits per segment. Its worst-case ability to correct transmission errors is very limited: in the worst case it can only detect a single bit error and cannot correct any errors. However, it works better in the [[Soft-decision decoder|soft-decision model of decoding]]: its regular structure allows the task of finding a maximum-likelihood decoding or a posteriori probability decoding to be performed in constant time per input bit.&lt;br /&gt;
&lt;br /&gt;
==Source==&lt;br /&gt;
&lt;br /&gt;
[http://wikipedia.org/ http://wikipedia.org/]&lt;br /&gt;
&lt;br /&gt;
[[Category:Error-correcting codes]]&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>