{"id":9,"date":"2023-03-09T18:46:23","date_gmt":"2023-03-09T18:46:23","guid":{"rendered":"https:\/\/paritybits.net\/?page_id=9"},"modified":"2023-03-09T19:00:43","modified_gmt":"2023-03-09T19:00:43","slug":"page-2","status":"publish","type":"page","link":"https:\/\/paritybits.net\/?page_id=9","title":{"rendered":"Cyclic Redundancy Check."},"content":{"rendered":"\n

The parity bit ensures that the total number of 1-bits in the string is even or odd. Accordingly, there are two variants of parity bits: even parity bit and odd parity bit. In the case of even parity, for a given set of bits, the bits whose value is 1 are counted. If that count is odd, the parity bit value is set to 1, making the total count of occurrences of 1s in the whole set (including the parity bit) an even number. If the count of 1s in a given set of bits is already even, the parity bit’s value is 0. In the case of odd parity, the coding is reversed. For a given set of bits, if the count of bits with a value of 1 is even, the parity bit value is set to 1 making the total count of 1s in the whole set (including the parity bit) an odd number. If the count of bits with a value of 1 is odd, the count is already odd so the parity bit’s value is 0. Even parity is a special case of a cyclic redundancy check (CRC), where the 1-bit CRC is generated by the polynomial x+1.<\/p>\n","protected":false},"excerpt":{"rendered":"

The parity bit ensures that the total number of 1-bits in the string is even or odd. Accordingly, there are two variants of parity bits: even parity bit and odd parity bit. In the case of even parity, for a given set of bits, the bits whose value is 1 are counted. If that count… Read More »Cyclic Redundancy Check.<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":4,"comment_status":"closed","ping_status":"closed","template":"","meta":{"neve_meta_sidebar":"","neve_meta_container":"","neve_meta_enable_content_width":"","neve_meta_content_width":0,"neve_meta_title_alignment":"","neve_meta_author_avatar":"","neve_post_elements_order":"","neve_meta_disable_header":"","neve_meta_disable_footer":"","neve_meta_disable_title":"","footnotes":""},"class_list":["post-9","page","type-page","status-publish","hentry"],"yoast_head":"\nCyclic Redundancy Check. - Error correction is fun.<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/paritybits.net\/?page_id=9\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Cyclic Redundancy Check. - Error correction is fun.\" \/>\n<meta property=\"og:description\" content=\"The parity bit ensures that the total number of 1-bits in the string is even or odd. Accordingly, there are two variants of parity bits: even parity bit and odd parity bit. In the case of even parity, for a given set of bits, the bits whose value is 1 are counted. If that count… Read More »Cyclic Redundancy Check.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/paritybits.net\/?page_id=9\" \/>\n<meta property=\"og:site_name\" content=\"Error correction is fun.\" \/>\n<meta property=\"article:modified_time\" content=\"2023-03-09T19:00:43+00:00\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/paritybits.net\/?page_id=9\",\"url\":\"https:\/\/paritybits.net\/?page_id=9\",\"name\":\"Cyclic Redundancy Check. - Error correction is fun.\",\"isPartOf\":{\"@id\":\"https:\/\/paritybits.net\/#website\"},\"datePublished\":\"2023-03-09T18:46:23+00:00\",\"dateModified\":\"2023-03-09T19:00:43+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/paritybits.net\/?page_id=9#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/paritybits.net\/?page_id=9\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/paritybits.net\/?page_id=9#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/paritybits.net\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Cyclic Redundancy Check.\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/paritybits.net\/#website\",\"url\":\"https:\/\/paritybits.net\/\",\"name\":\"Error correction is fun.\",\"description\":\"Ever wanted to learn about error correction?\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/paritybits.net\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Cyclic Redundancy Check. - Error correction is fun.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/paritybits.net\/?page_id=9","og_locale":"en_US","og_type":"article","og_title":"Cyclic Redundancy Check. - Error correction is fun.","og_description":"The parity bit ensures that the total number of 1-bits in the string is even or odd. Accordingly, there are two variants of parity bits: even parity bit and odd parity bit. In the case of even parity, for a given set of bits, the bits whose value is 1 are counted. If that count… Read More »Cyclic Redundancy Check.","og_url":"https:\/\/paritybits.net\/?page_id=9","og_site_name":"Error correction is fun.","article_modified_time":"2023-03-09T19:00:43+00:00","twitter_card":"summary_large_image","twitter_misc":{"Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/paritybits.net\/?page_id=9","url":"https:\/\/paritybits.net\/?page_id=9","name":"Cyclic Redundancy Check. - Error correction is fun.","isPartOf":{"@id":"https:\/\/paritybits.net\/#website"},"datePublished":"2023-03-09T18:46:23+00:00","dateModified":"2023-03-09T19:00:43+00:00","breadcrumb":{"@id":"https:\/\/paritybits.net\/?page_id=9#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/paritybits.net\/?page_id=9"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/paritybits.net\/?page_id=9#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/paritybits.net\/"},{"@type":"ListItem","position":2,"name":"Cyclic Redundancy Check."}]},{"@type":"WebSite","@id":"https:\/\/paritybits.net\/#website","url":"https:\/\/paritybits.net\/","name":"Error correction is fun.","description":"Ever wanted to learn about error correction?","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/paritybits.net\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"}]}},"_links":{"self":[{"href":"https:\/\/paritybits.net\/index.php?rest_route=\/wp\/v2\/pages\/9","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/paritybits.net\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/paritybits.net\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/paritybits.net\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/paritybits.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=9"}],"version-history":[{"count":2,"href":"https:\/\/paritybits.net\/index.php?rest_route=\/wp\/v2\/pages\/9\/revisions"}],"predecessor-version":[{"id":12,"href":"https:\/\/paritybits.net\/index.php?rest_route=\/wp\/v2\/pages\/9\/revisions\/12"}],"wp:attachment":[{"href":"https:\/\/paritybits.net\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=9"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}