Image:Hamming distance 4 bit binary example.svg

From Wikipedia, the free encyclopedia

Hamming_distance_4_bit_binary_example.svg‎ (SVG file, nominally 370 × 225 pixels, file size: 26 KB)

Wikimedia Commons logo This is a file from the Wikimedia Commons. The description on its description page there is shown below.
Commons is a freely licensed media file repository. You can help.

[edit] Summary

Description

en: Hamming distance cube for 4-bit binary numbers with two examples:

  • red path has a hamming distance of 3 (0100 requires 3 bits changed to get to 1001)
  • blue path has a hamming distance of 1 (0110 requires 1 bit changed to get to 1110)
Source

Own work with Inkscape
Date

December 31, 2006
Author

en:User:Cburnett
Permission
(Reusing this image)

GFDL

[edit] Licensing

I, the copyright holder of this work, hereby publish it under the following license:
GNU head Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation license, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled "GNU Free Documentation license".

Aragonés | العربية | Asturianu | Български | বাংলা | ইমার ঠার/বিষ্ণুপ্রিয়া মণিপুরী | Brezhoneg | Bosanski | Català | Cebuano | Česky | Dansk | Deutsch | Ελληνικά | English | Esperanto | Español | Eesti | Euskara | فارسی | Suomi | Français | Gaeilge | Galego | עברית | Hrvatski | Magyar | Bahasa Indonesia | Ido | Íslenska | Italiano | 日本語 | ქართული | ភាសាខ្មែរ | 한국어 | Kurdî / كوردی | Latina | Lëtzebuergesch | Lietuvių | Bahasa Melayu | Nnapulitano | Nederlands | ‪Norsk (nynorsk)‬ | ‪Norsk (bokmål)‬ | Occitan | Polski | Português | Română | Русский | Slovenčina | Slovenščina | Shqip | Српски / Srpski | Svenska | తెలుగు | ไทย | Türkçe | Українська | اردو | Tiếng Việt | Volapük | Yorùbá | ‪中文(中国大陆)‬ | ‪中文(台灣)‬ | +/-

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeDimensionsUserComment
current01:13, 1 January 2007370×225 (26 KB)Cburnett ({{Information |Description='''en:''' Hamming distance cube for 4-bit binary numbers with two examples: * red path has a hamming distance of 3 (0100 requires 3 bits changed to get to 1001) * blue path has a hamming distance of 1 (0110 requires 1 bit change)
The following pages on the English Wikipedia link to this file (pages on other projects are not listed):