<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Code_rate</id>
	<title>Code rate - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Code_rate"/>
	<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Code_rate&amp;action=history"/>
	<updated>2026-10-26T12:48:54Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>http://debianws.lexgopc.com/wiki143/index.php?title=Code_rate&amp;diff=3806128&amp;oldid=prev</id>
		<title>imported&gt;Jlwoodwa: tag as one source</title>
		<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Code_rate&amp;diff=3806128&amp;oldid=prev"/>
		<updated>2024-04-12T05:42:50Z</updated>

		<summary type="html">&lt;p&gt;tag as one source&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Short description|Non-redundant proportion of an error correction code data stream}}&lt;br /&gt;
{{one source |date=April 2024}}&lt;br /&gt;
[[File:Coderateblock.png|400px|thumb|right|Different code rates ([[Hamming code]]).]]&lt;br /&gt;
In [[telecommunication]] and [[information theory]], the &amp;#039;&amp;#039;&amp;#039;code rate&amp;#039;&amp;#039;&amp;#039; (or &amp;#039;&amp;#039;&amp;#039;information rate&amp;#039;&amp;#039;&amp;#039;&amp;lt;ref&amp;gt;Huffman, W. Cary, and Pless, Vera, &amp;#039;&amp;#039;Fundamentals of Error-Correcting Codes&amp;#039;&amp;#039;, Cambridge, 2003.&amp;lt;/ref&amp;gt;) of a [[forward error correction]] code is the proportion of the data-stream that is useful (non-[[Redundancy (information theory)|redundant]]). That is, if the code rate is &amp;lt;math&amp;gt;k/n&amp;lt;/math&amp;gt; for every {{mvar|k}} bits of useful information, the coder generates a total of {{mvar|n}} bits of data, of which &amp;lt;math&amp;gt;n-k&amp;lt;/math&amp;gt; are redundant. &lt;br /&gt;
&lt;br /&gt;
If {{mvar|R}} is the [[gross bit rate]] or [[data signalling rate]] (inclusive of redundant error coding), the [[net bit rate]] (the useful bit rate exclusive of [[error correction code]]s) is &amp;lt;math&amp;gt;\leq R \cdot k/n&amp;lt;/math&amp;gt;. &lt;br /&gt;
&lt;br /&gt;
For example: The code rate of a [[convolutional code]] will typically be {{1/2}}, {{2/3}}, {{3/4}}, {{frac|5|6}}, {{frac|7|8}}, etc., corresponding to one redundant bit inserted after every single, second, third, etc., bit. The code rate of the [[octet (computing)|octet]] oriented [[Reed Solomon]] [[block code]] denoted RS(204,188) is 188/204, meaning that {{math|1=204 &amp;amp;minus; 188 = 16}} redundant octets (or bytes) are added to each block of 188 octets of useful information. &lt;br /&gt;
&lt;br /&gt;
A few error correction codes do not have a fixed code rate—[[rateless erasure code]]s.&lt;br /&gt;
&lt;br /&gt;
Note that [[bit/s]] is a more widespread [[unit of measurement]] for the [[information rate]], implying that it is synonymous with &amp;#039;&amp;#039;net bit rate&amp;#039;&amp;#039; or &amp;#039;&amp;#039;useful bit rate&amp;#039;&amp;#039; exclusive of error-correction codes.&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
* [[Entropy rate]]&lt;br /&gt;
* [[Information rate]]&lt;br /&gt;
* [[Punctured code]]&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Information theory]]&lt;br /&gt;
[[Category:Rates]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Comp-sci-stub}}&lt;/div&gt;</summary>
		<author><name>imported&gt;Jlwoodwa</name></author>
	</entry>
</feed>