Expander code (original) (raw)
In coding theory, expander codes form a class of error-correcting codes that are constructed from bipartite expander graphs.Along with Justesen codes, expander codes are of particular interest since they have a constant positive rate, a constant positive relative distance, and a constant alphabet size.In fact, the alphabet contains only two elements, so expander codes belong to the class of binary codes.Furthermore, expander codes can be both encoded and decoded in time proportional to the block length of the code.
| Property | Value |
|---|---|
| dbo:abstract | In coding theory, expander codes form a class of error-correcting codes that are constructed from bipartite expander graphs.Along with Justesen codes, expander codes are of particular interest since they have a constant positive rate, a constant positive relative distance, and a constant alphabet size.In fact, the alphabet contains only two elements, so expander codes belong to the class of binary codes.Furthermore, expander codes can be both encoded and decoded in time proportional to the block length of the code. (en) |
| dbo:thumbnail | wiki-commons:Special:FilePath/Tanner_graph_example.png?width=300 |
| dbo:wikiPageID | 31667930 (xsd:integer) |
| dbo:wikiPageLength | 14532 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1119299099 (xsd:integer) |
| dbo:wikiPageWikiLink | dbc:Capacity-approaching_codes dbr:Binary_code dbr:Block_code dbr:Error_detection_and_correction dbr:Low-density_parity-check_code dbr:Justesen_code dbc:Coding_theory dbr:Expander_graph dbc:Error_detection_and_correction dbr:Bipartite_graph dbr:Biregular_graph dbr:Coding_theory dbr:Linear_block_code dbr:File:Tanner_graph_example.PNG |
| dbp:date | July 2012 (en) |
| dbp:imageCaption | bipartite expander graph (en) |
| dbp:name | Expander codes (en) |
| dbp:notation | -code (en) |
| dbp:reason | Missing definitions, and grammar requires heavy copy-editing. Blindly pointing to the references should not be the point of the article. Missing scholarly exposition. (en) |
| dbp:type | dbr:Linear_block_code |
| dbp:wikiPageUsesTemplate | dbt:Cleanup dbt:Infobox_code |
| dct:subject | dbc:Capacity-approaching_codes dbc:Coding_theory dbc:Error_detection_and_correction |
| rdf:type | yago:WikicatCapacity-approachingCodes yago:Abstraction100002137 yago:Code106667317 yago:Communication100033020 yago:WrittenCommunication106349220 |
| rdfs:comment | In coding theory, expander codes form a class of error-correcting codes that are constructed from bipartite expander graphs.Along with Justesen codes, expander codes are of particular interest since they have a constant positive rate, a constant positive relative distance, and a constant alphabet size.In fact, the alphabet contains only two elements, so expander codes belong to the class of binary codes.Furthermore, expander codes can be both encoded and decoded in time proportional to the block length of the code. (en) |
| rdfs:label | Expander code (en) |
| owl:sameAs | freebase:Expander code wikidata:Expander code https://global.dbpedia.org/id/4k7DR yago-res:Expander code |
| prov:wasDerivedFrom | wikipedia-en:Expander_code?oldid=1119299099&ns=0 |
| foaf:depiction | wiki-commons:Special:FilePath/Tanner_graph_example.png |
| foaf:isPrimaryTopicOf | wikipedia-en:Expander_code |
| is dbo:wikiPageWikiLink of | dbr:Block_code dbr:Error_correction_code dbr:Low-density_parity-check_code dbr:Locally_testable_code dbr:Justesen_code dbr:Linear_code dbr:Expander_graph dbr:Michael_Sipser dbr:Ramanujan_graph dbr:Zemor's_decoding_algorithm |
| is foaf:primaryTopic of | wikipedia-en:Expander_code |
