Sciweavers

63 search results - page 7 / 13
» Subspace Codes
Sort
View
CORR
2007
Springer
129views Education» more  CORR 2007»
13 years 7 months ago
A Rank-Metric Approach to Error Control in Random Network Coding
It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rank-metric codes. This result allows many of the too...
Danilo Silva, Frank R. Kschischang, Ralf Koetter
TSP
2008
90views more  TSP 2008»
13 years 7 months ago
Generalized Correlation Decomposition-Based Blind Channel Estimation in DS-CDMA Systems With Unknown Wide-Sense Stationary Noise
A new blind subspace-based channel estimation technique is proposed for direct-sequence code-division multiple access (DS-CDMA) systems operating in the presence of unknown wide-se...
Keyvan Zarifi, Alex B. Gershman
ICIP
2001
IEEE
14 years 9 months ago
The orientation adaptive lapped biorthogonal transform for efficient image coding
A lapped biorthogonal transform adapted for local directionality of an image is proposed. The proposed transform consists of overlapping basis functions and non-overlapping basis ...
Toshihsa Tanaka, Y. Yamashita
IVC
2002
91views more  IVC 2002»
13 years 7 months ago
Compensating for ensemble-specific effects when building facial models
When attempting to code faces for modeling or recognition, estimates of dimensions are typically obtained from an ensemble. These tend to be significantly sub-optimal. Firstly, en...
Nicholas Costen, Timothy F. Cootes, Christopher J....
IACR
2011
91views more  IACR 2011»
12 years 7 months ago
Improved Generalized Birthday Attack
Let r, B and w be positive integers. Let C be a linear code of length Bw and subspace of Fr 2. The k-regular-decoding problem is to find a nonzero codeword consisting of w length...
Paul Kirchner