Block Code
In coding theory, block codes refers to the large and important family of error-correcting codes that encode data in blocks. There is a vast number of examples for block codes, many of which have a wide range of practical applications. The main reason why the concept of block codes is so useful is that it allows coding theorists, mathematicians, and computer scientists to study the limitations of all block codes in a unified way. 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 codes, Hamming codes, Hadamard codes, Expander codes, Golay codes, and Reed–Muller codes. These examples also belong to the class of linear codes, and hence they are called linear block codes.
Read more about Block Code: The Block Code and Its Parameters, Examples, Error Detection and Correction Properties, Sphere Packings and Lattices
Famous quotes containing the words block and/or code:
“Dug from the tomb of taste-refining time,
Each form is exquisite, each block sublime.
Or good, or bad,—disfigur’d, or deprav’d,—
All art, is at its resurrection sav’d;
All crown’d with glory in the critic’s heav’n,
Each merit magnified, each fault forgiven.”
—Martin Archer, Sir Shee (1769–1850)
“...I had grown up in a world that was dominated by immature age. Not by vigorous immaturity, but by immaturity that was old and tired and prudent, that loved ritual and rubric, and was utterly wanting in curiosity about the new and the strange. Its era has passed away, and the world it made has crumbled around us. Its finest creation, a code of manners, has been ridiculed and discarded.”
—Ellen Glasgow (1873–1945)