133 search results - page 5 / 27 » Linear Operator Channels over Finite Fields |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
ASIACRYPT
1999
Springer
13 years 11 months ago
1999
Springer
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
CORR
2008
Springer
13 years 7 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...
ISSAC
2004
Springer
14 years 21 days ago
2004
Springer
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...