Sciweavers

2081 search results - page 58 / 417
» codes 2006
Sort
View
IJON
2002
90views more  IJON 2002»
14 years 11 months ago
Linearly decodable functions from neural population codes
The population vector is a linear decoder for an ensemble of neurons, whose response properties are nonlinear functions of the input vector. However, previous analyses of this deco...
M. Brandon Westover, Chris Eliasmith, Charles H. A...
CODES
2006
IEEE
15 years 6 months ago
Retargetable code optimization with SIMD instructions
Retargetable C compilers are nowadays widely used to quickly obtain compiler support for new embedded processors and to perform early processor architecture exploration. One frequ...
Manuel Hohenauer, Christoph Schumacher, Rainer Leu...
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
16 years 4 days ago
Explicit capacity-achieving list-decodable codes
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
Venkatesan Guruswami, Atri Rudra
CORR
2006
Springer
163views Education» more  CORR 2006»
14 years 12 months ago
Finding roots of polynomials over finite fields
In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-S...
Sergei V. Fedorenko, Peter Vladimirovich Trifonov
IPL
2000
77views more  IPL 2000»
14 years 11 months ago
Efficient loopless generation of Gray codes for k-ary trees
Vajnovszki recently developed a loopless algorithm [Inform. Process. Lett. 68 (1998) 113] to enumerate Gray codes for binary trees, and then Korsh and Lafollette gave a loopless a...
Limin Xiang, Kazuo Ushijima, Changjie Tang