Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Hamming code
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Encoding=== ;Example From the above matrix we have 2<sup>k</sup> = 2<sup>4</sup> = 16 codewords. Let <math>\vec{a}</math> be a row vector of binary data bits, <math> \vec{a}=[a_1,a_2,a_3,a_4],\quad a_i\in \{0,1\} </math>. The codeword <math>\vec{x}</math> for any of the 16 possible data vectors <math> \vec{a} </math> is given by the standard matrix product <math>\vec{x}=\vec{a}G </math> where the summing operation is done modulo-2. For example, let <math>\vec{a}=[1,0,1,1]</math>. Using the generator matrix <math>G</math> from above, we have (after applying modulo 2, to the sum), <math>\vec{x}=\vec{a}G= \begin{pmatrix} 1 & 0 & 1 & 1 \end{pmatrix}\begin{pmatrix} 1 & 0 & 0 & 0 & 1 & 1 & 0 \\ 0 & 1 & 0 & 0 & 1 & 0 & 1 \\ 0 & 0 & 1 & 0 & 0 & 1 & 1 \\ 0 & 0 & 0 & 1 & 1 & 1 & 1 \\ \end{pmatrix} = \begin{pmatrix} 1 & 0 & 1 & 1 & 2 & 3 & 2 \end{pmatrix} = \begin{pmatrix} 1 & 0 & 1 & 1 & 0 & 1 & 0 \end{pmatrix}</math>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)