Sciweavers

3373 search results - page 144 / 675
» Linear transformations on codes
Sort
View
90
Voted
ICASSP
2008
IEEE
15 years 10 months ago
Decoding real-field codes by an iterative Expectation-Maximization (EM) algorithm
In this paper, a new approach for decoding real-field codes based on finding sparse solutions of underdetermined linear systems is proposed. This algorithm iteratively estimates...
Hadi Zayyani, Massoud Babaie-Zadeh, Christian Jutt...
ICC
2007
IEEE
185views Communications» more  ICC 2007»
15 years 7 months ago
Systematic Modification of Parity-Check Matrices for Efficient Encoding of LDPC Codes
An algorithm for efficient encoding of LDPC codes is presented that does not impose any restrictions on the construction of the parity-check matrices. The algorithm modifies the pa...
Mohamed Shaqfeh, Norbert Görtz
119
Voted
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
15 years 5 months ago
Corruption and Recovery-Efficient Locally Decodable Codes
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...
David P. Woodruff
154
Voted
HIPC
2005
Springer
15 years 9 months ago
Cooperative Instruction Scheduling with Linear Scan Register Allocation
Abstract. Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear ...
Khaing Khaing Kyi Win, Weng-Fai Wong
133
Voted
CODES
2009
IEEE
15 years 10 months ago
On compile-time evaluation of process partitioning transformations for Kahn process networks
Kahn Process Networks is an appealing model of computation for programming and mapping applications onto multi-processor platforms. Autonomous processes communicate through unboun...
Sjoerd Meijer, Hristo Nikolov, Todor Stefanov