Name
Abstract | ||
|---|---|---|
We present an efficient implementation of Sudan's algorithm for list decoding Hermitian codes beyond half the minimum distance. The main ingredients are an explicit method to calculate so-called increasing zero bases, an efficient interpolation algorithm for finding the Q- polynomial, and a reduction of the problemof factoring the Q-polynomial to the problem of factoring a univariate polynomial over a large finite field. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/3-540-46796-3_26 | AAECC |
Keywords | Field | DocType |
minimum distance,main ingredient,explicit method,univariate polynomial,hermitian code,decoding hermitian codes,zero base,large finite field,efficient interpolation algorithm,efficient implementation,list decoding,finite field | Polynomial,Interpolation,Cyclic code,Hermitian function,List decoding,Discrete mathematics,Combinatorics,Finite field,Algebra,Algorithm,Factorization,Hermitian matrix,Mathematics | Conference |
Volume | ISSN | ISBN |
1719 | 0302-9743 | 3-540-66723-7 |
Citations | PageRank | References |
23 | 3.99 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tom Høholdt | 1 | 186 | 28.53 |
| R. Refslund Nielsen | 2 | 36 | 5.41 |