Sciweavers

314 search results - page 9 / 63
» A Comparison of Known Codes, Random Codes, and the Best Code...
Sort
View
VTC
2007
IEEE
136views Communications» more  VTC 2007»
14 years 2 months ago
4-PSK Balanced STTC with Two Transmit Antennas
— In this paper we introduce a new class of space-time trellis codes (STTC). We call them Balanced STTC (B-STTC) because the points of the constellation are used with the same pr...
Thi Minh Hien Ngo, Gheorghe Zaharia, Stephane Boug...
EUROCRYPT
2012
Springer
11 years 11 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
TIT
2008
95views more  TIT 2008»
13 years 8 months ago
On the Delay and Throughput Gains of Coding in Unreliable Networks
In an unreliable packet network setting, we study the performance gains of optimal transmission strategies in the presence and absence of coding capability at the transmitter, wher...
Atilla Eryilmaz, Asuman E. Ozdaglar, Muriel M&eacu...
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
14 years 9 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
ICALP
2005
Springer
14 years 2 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller