Berger code (original) (raw)
In telecommunication, a Berger code is a unidirectional error detecting code, named after its inventor, J. M. Berger. Berger codes can detect all unidirectional errors. Unidirectional errors are errors that only flip ones into zeroes or only zeroes into ones, such as in asymmetric channels. The check bits of Berger codes are computed by counting all the zeroes in the information word, and expressing that number in natural binary. If the information word consists of bits, then the Berger code needs "check bits", giving a Berger code of length k+n. (In other words, the check bits are enough to check up to information bits).Berger codes can detect any number of one-to-zero bit-flip errors, as long as no zero-to-one errors occurred in the same code word.Similarly, Berger codes can detect a
| Property | Value |
|---|---|
| dbo:abstract | In telecommunication, a Berger code is a unidirectional error detecting code, named after its inventor, J. M. Berger. Berger codes can detect all unidirectional errors. Unidirectional errors are errors that only flip ones into zeroes or only zeroes into ones, such as in asymmetric channels. The check bits of Berger codes are computed by counting all the zeroes in the information word, and expressing that number in natural binary. If the information word consists of bits, then the Berger code needs "check bits", giving a Berger code of length k+n. (In other words, the check bits are enough to check up to information bits).Berger codes can detect any number of one-to-zero bit-flip errors, as long as no zero-to-one errors occurred in the same code word.Similarly, Berger codes can detect any number of zero-to-one bit-flip errors, as long as no one-to-zero bit-flip errors occur in the same code word.Berger codes cannot correct any error. Like all unidirectional error detecting codes,Berger codes can also be used in delay-insensitive circuits. (en) |
| dbo:wikiPageExternalLink | http://alexandria.tue.nl/extra1/wskrap/publichtml/8837761.pdf https://web.archive.org/web/20170705061209/http:/crc.stanford.edu/crc_papers/mitraitc002.pdf |
| dbo:wikiPageID | 9898864 (xsd:integer) |
| dbo:wikiPageLength | 4465 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1121111958 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Error_detection_and_correction dbc:Coding_theory dbr:Flash_memory dbr:Telecommunication dbc:Error_detection_and_correction dbr:Check_bits dbr:Delay-insensitive |
| dbp:wikiPageUsesTemplate | dbt:Cite_journal |
| dcterms:subject | dbc:Coding_theory dbc:Error_detection_and_correction |
| rdfs:comment | In telecommunication, a Berger code is a unidirectional error detecting code, named after its inventor, J. M. Berger. Berger codes can detect all unidirectional errors. Unidirectional errors are errors that only flip ones into zeroes or only zeroes into ones, such as in asymmetric channels. The check bits of Berger codes are computed by counting all the zeroes in the information word, and expressing that number in natural binary. If the information word consists of bits, then the Berger code needs "check bits", giving a Berger code of length k+n. (In other words, the check bits are enough to check up to information bits).Berger codes can detect any number of one-to-zero bit-flip errors, as long as no zero-to-one errors occurred in the same code word.Similarly, Berger codes can detect a (en) |
| rdfs:label | Berger code (en) |
| owl:sameAs | freebase:Berger code wikidata:Berger code https://global.dbpedia.org/id/4XstY |
| prov:wasDerivedFrom | wikipedia-en:Berger_code?oldid=1121111958&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Berger_code |
| is dbo:wikiPageRedirects of | dbr:Unidirectional_error |
| is dbo:wikiPageWikiLink of | dbr:List_of_algebraic_coding_theory_topics dbr:Error_correction_code dbr:Error_detection_and_correction dbr:Constant-weight_code dbr:Unidirectional_error |
| is foaf:primaryTopic of | wikipedia-en:Berger_code |