About: Berlekamp–Welch algorithm     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatFiniteFields, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FBerlekamp%E2%80%93Welch_algorithm

The Berlekamp–Welch algorithm, also known as the Welch–Berlekamp algorithm, is named for Elwyn R. Berlekamp and Lloyd R. Welch. This is a decoder algorithm that efficiently corrects errors in Reed–Solomon codes for an RS(n, k), code based on the Reed Solomon original view where a message is used as coefficients of a polynomial or used with Lagrange interpolation to generate the polynomial of degree < k for inputs and then is applied to to create an encoded codeword .

AttributesValues
rdf:type
rdfs:label
  • Algoritmo de Berlekamp-Welch (es)
  • Berlekamp–Welch algorithm (en)
  • 伯利坎普－韦尔奇算法 (zh)
rdfs:comment
  • 伯利坎普－韦尔奇算法（英語：Berlekamp-Welch algorithm）是一種用於高效地解碼BCH碼與里德-所羅門碼的演算法，其名取自埃尔温·伯利坎普與。伯利坎普－韦尔奇算法的優點在於這一演算法僅需利用矩陣運算。這一演算法的時間複雜度為。 (zh)
  • The Berlekamp–Welch algorithm, also known as the Welch–Berlekamp algorithm, is named for Elwyn R. Berlekamp and Lloyd R. Welch. This is a decoder algorithm that efficiently corrects errors in Reed–Solomon codes for an RS(n, k), code based on the Reed Solomon original view where a message is used as coefficients of a polynomial or used with Lagrange interpolation to generate the polynomial of degree < k for inputs and then is applied to to create an encoded codeword . (en)
  • El algoritmo de Berlekamp-Welch, también conocido como el algoritmo de Welch-Berlekamp, lleva el nombre de Elwyn R. Berlekamp y Lloyd R. Welch.​​ Este es un algoritmo decodificador que corrige de manera eficiente los errores en los códigos Reed-Solomon para un código RS (n, k), basado en la vista original de Reed Solomon donde un mensaje se utiliza como coeficientes de un polinomio o se utiliza con la interpolación de Lagrange para generar el polinomio de grado < k para entradas y luego es aplicado a para crear una palabra de código codificada .​​ (es)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • The Berlekamp–Welch algorithm, also known as the Welch–Berlekamp algorithm, is named for Elwyn R. Berlekamp and Lloyd R. Welch. This is a decoder algorithm that efficiently corrects errors in Reed–Solomon codes for an RS(n, k), code based on the Reed Solomon original view where a message is used as coefficients of a polynomial or used with Lagrange interpolation to generate the polynomial of degree < k for inputs and then is applied to to create an encoded codeword . The goal of the decoder is to recover the original encoding polynomial , using the known inputs and received codeword with possible errors. It also computes an error polynomial where corresponding to errors in the received codeword. (en)
  • El algoritmo de Berlekamp-Welch, también conocido como el algoritmo de Welch-Berlekamp, lleva el nombre de Elwyn R. Berlekamp y Lloyd R. Welch.​​ Este es un algoritmo decodificador que corrige de manera eficiente los errores en los códigos Reed-Solomon para un código RS (n, k), basado en la vista original de Reed Solomon donde un mensaje se utiliza como coeficientes de un polinomio o se utiliza con la interpolación de Lagrange para generar el polinomio de grado < k para entradas y luego es aplicado a para crear una palabra de código codificada .​​ El objetivo del decodificador es recuperar el polinomio de codificación original , utilizando las entradas conocidas y recibida la palabra en clave con posibles errores. También calcula un error polinomial donde corresponde a errores en la palabra de código recibida.​​ (es)
  • 伯利坎普－韦尔奇算法（英語：Berlekamp-Welch algorithm）是一種用於高效地解碼BCH碼與里德-所羅門碼的演算法，其名取自埃尔温·伯利坎普與。伯利坎普－韦尔奇算法的優點在於這一演算法僅需利用矩陣運算。這一演算法的時間複雜度為。 (zh)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is known for of
is known for of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 50 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software