Sciweavers

314 search results - page 11 / 63
» A Comparison of Known Codes, Random Codes, and the Best Code...
Sort
View
IMA
1999
Springer
129views Cryptology» more  IMA 1999»
14 years 26 days ago
Some Soft-Decision Decoding Algorithms for Reed-Solomon Codes
Abstract. In this paper we introduce three soft-decision decoding algorithms for Reed-Solomon (RS) codes. We compare them in terms of performance over both the AWGN and Rayleigh Fa...
Stephan Wesemeyer, Peter Sweeney, David R. B. Burg...
COOPIS
2003
IEEE
14 years 1 months ago
DLS: A CORBA Service for Dynamic Loading of Code
Dynamic loading of code is needed when rarely used code should be loaded on demand or when the code to be loaded is not known in advance. In distributed systems it can also be used...
Rüdiger Kapitza, Franz J. Hauck
ECCC
2007
88views more  ECCC 2007»
13 years 8 months ago
Combinatorial Construction of Locally Testable Codes
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a constan...
Or Meir
TIT
1998
73views more  TIT 1998»
13 years 8 months ago
Subspace Subcodes of Reed-Solomon Codes
— In this paper we introduce a class of nonlinear cyclic error-correcting codes, which we call subspace subcodes of Reed–Solomon (SSRS) codes. An SSRS code is a subset of a par...
Masayuki Hattori, Robert J. McEliece, Gustave Solo...
CORR
2011
Springer
166views Education» more  CORR 2011»
13 years 11 days ago
A family of fast-decodable MIDO codes from crossed-product algebras over Q
—Multiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable dev...
Laura Luzzi, Frédérique E. Oggier