Sciweavers

314 search results - page 10 / 63
» A Comparison of Known Codes, Random Codes, and the Best Code...
Sort
View
CORR
2010
Springer
77views Education» more  CORR 2010»
13 years 7 months ago
Reduced ML-Decoding Complexity, Full-Rate STBCs for $2^a$ Transmit Antenna Systems
— For an nt transmit, nr receive antenna system (nt × nr system), a full-rate space time block code (STBC) transmits nmin = min(nt, nr) complex symbols per channel use and in ge...
K. Pavan Srinath, B. Sundar Rajan
ADT
2005
13 years 8 months ago
On Multiple Slice Turbo Codes
: The main problem concerning the hardware implementation of turbo codes is the lack of parallelism in the MAP-based decoding algorithm. This paper proposes to overcome this proble...
David Gnaedig, Emmanuel Boutillon, Michel Jé...
IMA
2009
Springer
152views Cryptology» more  IMA 2009»
14 years 3 months ago
Codes as Modules over Skew Polynomial Rings
In previous works we considered codes defined as ideals of quotients of skew polynomial rings, so called Ore rings of automorphism type. In this paper we consider codes defined a...
Delphine Boucher, Felix Ulmer
CORR
2010
Springer
75views Education» more  CORR 2010»
13 years 6 months ago
Dense Error-Correcting Codes in the Lee Metric
Several new applications and a number of new mathematical techniques have increased the research on errorcorrecting codes in the Lee metric in the last decade. In this work we cons...
Tuvi Etzion, Alexander Vardy, Eitan Yaakobi
TIT
2002
78views more  TIT 2002»
13 years 8 months ago
Improved upper bounds on sizes of codes
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...
Beniamin Mounits, Tuvi Etzion, Simon Litsyn