77 search results - page 2 / 16 » Near-MDS codes over some small fields |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the genera...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-S...
FFA
2008
13 years 8 months ago
2008
Abstract. The subset sum problem over finite fields is a well known NPcomplete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study th...
PKC
2011
Springer
12 years 11 months ago
2011
Springer
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
COCO
2008
Springer
13 years 10 months ago
2008
Springer
We prove that the sum of d small-bias generators L : Fs Fn fools degree-d polynomials in n variables over a field F, for any fixed degree d and field F, including F = F2 = {0, 1}...