3373 search results - page 204 / 675 » Linear transformations on codes |
137
click to vote
DSMML
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Gaussian process prior systems generally consist of noisy measurements of samples of the putatively Gaussian process of interest, where the samples serve to constrain the...
117
click to vote
AAAI
1998
15 years 5 months ago
1998
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
113
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We present an algorithm to perform a simultaneous modular reduction of several residues. This enables to compress polynomials into integers and perform several modular operations ...
93
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract--In this paper we construct low ML decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condit...
125
click to vote
TIT
2002
15 years 3 months ago
2002
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...