71 search results - page 9 / 15 » Bijective Linear Time Coding and Decoding for k-Trees |
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs...
VTC
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— Linear dispersion coded orthogonal frequency division multiplexing (LDC-OFDM) has recently been proposed to improve joint frequency and time diversity. This paper inves...
MLMI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper proposes an analysis technique for wide-band audio applications based on the predictability of the temporal evolution of Quadrature Mirror Filter (QMF) sub-ban...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...