1245 search results - page 16 / 249 » Binary Sparse Coding |
SIAMDM
2008
13 years 9 months ago
2008
Binary hyper-Kloosterman codes C(r, m) of length (2r - 1)m-1 are a quasi-cyclic
DCC
1999
IEEE
13 years 9 months ago
1999
IEEE
We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.
PARA
2004
Springer
14 years 3 months ago
2004
Springer
The sparse Cholesky factorization of some large matrices can require a two dimensional partitioning of the matrix. The sparse hypermatrix storage scheme produces a recursive 2D par...
ICCCN
2007
IEEE
14 years 4 months ago
2007
IEEE
—For real-time wireless communications, short forward error-correcting (FEC) codes are indispensable due to the strict delay requirement. In this paper we study the performance o...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
A coding method using binary sequences is presented for different computation problems related to Catalan numbers. This method proves in a very easy way the equivalence of these pr...