Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q272172> ?p ?o }
Showing triples 1 to 63 of
63
with 100 triples per page.
- Q272172 subject Q7013670.
- Q272172 subject Q7413945.
- Q272172 subject Q7451516.
- Q272172 subject Q7463500.
- Q272172 subject Q8268978.
- Q272172 subject Q8268991.
- Q272172 abstract "In information theory, the Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. In another way, it measures the minimum number of substitutions required to change one string into the other, or the minimum number of errors that could have transformed one string into the other.A major application is in coding theory, more specifically to block codes, in which the equal-length strings are vectors over a finite field.".
- Q272172 thumbnail Hamming_distance_3_bit_binary.svg?width=300.
- Q272172 wikiPageExternalLink hamming.pdf.
- Q272172 wikiPageWikiLink Q1062839.
- Q272172 wikiPageWikiLink Q1120519.
- Q272172 wikiPageWikiLink Q125977.
- Q272172 wikiPageWikiLink Q131222.
- Q272172 wikiPageWikiLink Q1326388.
- Q272172 wikiPageWikiLink Q1334846.
- Q272172 wikiPageWikiLink Q15777.
- Q272172 wikiPageWikiLink Q161053.
- Q272172 wikiPageWikiLink Q178377.
- Q272172 wikiPageWikiLink Q184754.
- Q272172 wikiPageWikiLink Q208216.
- Q272172 wikiPageWikiLink Q213723.
- Q272172 wikiPageWikiLink Q2613728.
- Q272172 wikiPageWikiLink Q2657425.
- Q272172 wikiPageWikiLink Q28865.
- Q272172 wikiPageWikiLink Q332772.
- Q272172 wikiPageWikiLink Q3516404.
- Q272172 wikiPageWikiLink Q418.
- Q272172 wikiPageWikiLink Q4874866.
- Q272172 wikiPageWikiLink Q4883266.
- Q272172 wikiPageWikiLink Q496939.
- Q272172 wikiPageWikiLink Q498186.
- Q272172 wikiPageWikiLink Q5135421.
- Q272172 wikiPageWikiLink Q525506.
- Q272172 wikiPageWikiLink Q5645799.
- Q272172 wikiPageWikiLink Q5645805.
- Q272172 wikiPageWikiLink Q573509.
- Q272172 wikiPageWikiLink Q602136.
- Q272172 wikiPageWikiLink Q603880.
- Q272172 wikiPageWikiLink Q6515692.
- Q272172 wikiPageWikiLink Q7013670.
- Q272172 wikiPageWikiLink Q7413945.
- Q272172 wikiPageWikiLink Q7451516.
- Q272172 wikiPageWikiLink Q7463500.
- Q272172 wikiPageWikiLink Q8268978.
- Q272172 wikiPageWikiLink Q8268991.
- Q272172 wikiPageWikiLink Q838611.
- Q272172 wikiPageWikiLink Q847073.
- Q272172 wikiPageWikiLink Q853922.
- Q272172 wikiPageWikiLink Q863510.
- Q272172 wikiPageWikiLink Q865360.
- Q272172 wikiPageWikiLink Q865746.
- Q272172 wikiPageWikiLink Q8789.
- Q272172 wikiPageWikiLink Q879126.
- Q272172 wikiPageWikiLink Q884707.
- Q272172 wikiPageWikiLink Q900117.
- Q272172 wikiPageWikiLink Q9050568.
- Q272172 wikiPageWikiLink Q92619.
- Q272172 wikiPageWikiLink Q958394.
- Q272172 wikiPageWikiLink Q965866.
- Q272172 wikiPageWikiLink Q9779.
- Q272172 comment "In information theory, the Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. In another way, it measures the minimum number of substitutions required to change one string into the other, or the minimum number of errors that could have transformed one string into the other.A major application is in coding theory, more specifically to block codes, in which the equal-length strings are vectors over a finite field.".
- Q272172 label "Hamming distance".
- Q272172 depiction Hamming_distance_3_bit_binary.svg.