Home  

Random  

Nearby  



Log in  



Settings  



Donate  



About Wikipedia  

Disclaimers  



Wikipedia





Block code: Difference between revisions





Article  

Talk  



Language  

Watch  

View history  

Edit  






Browse history interactively
 Previous edit
Content deleted Content added
VisualWikitext
m Reverted edits by 2804:214:8496:4AE0:1:1:D4E2:B4F8 (talk) to last version by LilianaUwU
Add polar code to list of examples.
 
(4 intermediate revisions by 4 users not shown)
Line 4:
Such limitations often take the form of ''bounds'' that relate different parameters of the block code to each other, such as its rate and its ability to detect and correct errors.
 
Examples of block codes are [[Reed–Solomon code]]s, [[Hamming code]]s, [[Hadamard code]]s, [[Expander code]]s, [[Golay code (disambiguation)|Golay code]]s, [[Reed–Muller code]]s and [[Reed–MullerPolar code (coding theory)|Polar code]]s. These examples also belong to the class of [[linear code]]s, and hence they are called '''linear block codes'''. More particularly, these codes are known as algebraic block codes, or cyclic block codes, because they can be generated using boolean polynomials.
 
Algebraic block codes are typically [[Soft-decision decoder|hard-decoded]] using algebraic decoders.{{Technical statement|date=May 2015}}

Retrieved from "https://en.wikipedia.org/wiki/Block_code"
 




Languages

 



This page is not available in other languages.
 

Wikipedia




Privacy policy

About Wikipedia

Disclaimers

Contact Wikipedia

Code of Conduct

Developers

Statistics

Cookie statement

Terms of Use

Desktop