Sciweavers

67 search results - page 4 / 14
» Information-Set Decoding for Linear Codes over Fq
Sort
View
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 5 months ago
Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits
Abstract--We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that a...
Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tr...
CORR
2006
Springer
163views Education» more  CORR 2006»
13 years 5 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
CORR
2004
Springer
111views Education» more  CORR 2004»
13 years 5 months ago
Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear cod...
Venkatesan Guruswami, Alexander Vardy
CORR
2011
Springer
178views Education» more  CORR 2011»
13 years 23 days ago
Anytime Reliable Codes for Stabilizing Plants over Erasure Channels
—The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked contro...
Ravi Teja Sukhavasi, Babak Hassibi
ICASSP
2008
IEEE
14 years 6 days 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...