74 search results - page 3 / 15 » The communication complexity of the Hamming distance problem |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
STOC
2005
ACM
14 years 6 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
GLOBECOM
2007
IEEE
13 years 6 months ago
2007
IEEE
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
— This paper considers the quantization problem on the Grassmann manifold with dimension n and p. The unique contribution is the derivation of a closed-form formula for the volum...
ICPP
1995
IEEE
13 years 9 months ago
1995
IEEE
—We propose a unicasting algorithm for faulty hypercubes (including disconnected hypercubes) using the safety level concept. A faulty hypercube is a hypercube with faulty nodes a...