Name
Abstract | ||
|---|---|---|
Let $\mathbb{F}_q$ be a finite field with qelements and $C \subset \mathbb{F}_q^n$ a code of length n. If c驴 Cand h= (h1h2驴 hn) is a row of a parity check matrix of C, then it is clear that h·c= 0. Such parity checks can therefore be used to test if a given word $w \in \mathbb{F}_q^n$ is an element of C, but it turns out that the expressions h·w(usually called syndromes of w) can be useful in decoding algorithms as well. The link between decoding and syndromes is an old one. Indeed the first known algorithm for the decoding of Reed-Solomon codes (Peterson's algorithm) uses syndromes. Now let ${\mathcal P}=\{x_1,\dots,x_n\}$ be a subset of $\mathbb{F}_q$ consisting of ndistinct elements. We can see an RS-code of dimension k≤ nas the set of all n-tuples that arise by evaluating all polynomial f(x) of degree less than or equal to k驴 1 in the points x1,...,xn. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-87448-5_3 | ICMCTA |
Keywords | Field | DocType |
known algorithm,decoding algorithm,length n,reed-solomon code,expressions h,guruswami-sudan algorithm,parity check,parity check matrix,finite field,dimension k,syndrome formulation,cand h,interpolation step,reed solomon code | Discrete mathematics,Combinatorics,Finite field,Polynomial,Expression (mathematics),Parity-check matrix,Interpolation,Algorithm,Decoding methods,Parity (mathematics),Code (cryptography),Mathematics | Conference |
Volume | ISSN | Citations |
5228 | 0302-9743 | 1 |
PageRank | References | Authors |
0.36 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Beelen | 1 | 116 | 15.95 |
| Tom Høholdt | 2 | 186 | 28.53 |