An Entity of Type: ComputerLanguage106899633, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In computer science, repeat-accumulate codes (RA codes) are a low complexity class of error-correcting codes. They were devised so that their are easy to derive. RA codes were introduced by Divsalar et al.

Property Value
dbo:abstract
  • In computer science, repeat-accumulate codes (RA codes) are a low complexity class of error-correcting codes. They were devised so that their are easy to derive. RA codes were introduced by Divsalar et al. In an RA code, an of length is repeated times, scrambled by an interleaver of size , and then encoded by a rate 1 accumulator. The accumulator can be viewed as a truncated rate 1 recursive convolutional encoder with transfer function , but Divsalar et al. prefer to think of it as a block code whose input block and output block are related by the formula and for . The encoding time for RA codes is linear and their rate is . They are nonsystematic. (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 5880700 (xsd:integer)
dbo:wikiPageLength
  • 2600 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1104827949 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdf:type
rdfs:comment
  • In computer science, repeat-accumulate codes (RA codes) are a low complexity class of error-correcting codes. They were devised so that their are easy to derive. RA codes were introduced by Divsalar et al. (en)
rdfs:label
  • Repeat-accumulate code (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License