<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=AP_Physics_1</id>
	<title>AP Physics 1 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=AP_Physics_1"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=AP_Physics_1&amp;action=history"/>
	<updated>2026-06-05T07:54:53Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.0-wmf.28</generator>
	<entry>
		<id>https://en.formulasearchengine.com/index.php?title=AP_Physics_1&amp;diff=28356&amp;oldid=prev</id>
		<title>en&gt;Jameboy: /* History */ MOS:DATE</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=AP_Physics_1&amp;diff=28356&amp;oldid=prev"/>
		<updated>2014-02-02T05:28:21Z</updated>

		<summary type="html">&lt;p&gt;&lt;span class=&quot;autocomment&quot;&gt;History: &lt;/span&gt; &lt;a href=&quot;/index.php?title=MOS:DATE&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;MOS:DATE (page does not exist)&quot;&gt;MOS:DATE&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;In [[information theory]], a &amp;#039;&amp;#039;&amp;#039;polar code&amp;#039;&amp;#039;&amp;#039; is a [[linear block code|linear block]] [[error correcting code]] developed by [[Erdal Arıkan]].&amp;lt;ref&amp;gt;{{cite journal |first=E. |last=Arikan |title=Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels |journal=IEEE Transactions on Information Theory |volume=55 |issue=7 |pages=3051–73 |date=July 2009 |doi=10.1109/TIT.2009.2021379 |arxiv=0807.3917v5}}&amp;lt;/ref&amp;gt; It is the first code with an explicit construction to provably achieve the [[Noisy-channel coding theorem|channel capacity]] for symmetric binary-input, discrete, memoryless channels (B-DMC). Notably, polar codes have encoding and decoding complexity &amp;lt;math&amp;gt;O(n \log n)&amp;lt;/math&amp;gt;, which makes them practical for many applications.&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[:Category:Capacity-achieving codes]]&lt;br /&gt;
* [[:Category:Capacity-approaching codes]]&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Error detection and correction]]&lt;br /&gt;
[[Category:Coding theory]]&lt;br /&gt;
[[Category:Capacity-achieving codes]]&lt;br /&gt;
&lt;br /&gt;
{{Telecomm-stub}}&lt;/div&gt;</summary>
		<author><name>en&gt;Jameboy</name></author>
	</entry>
</feed>