2060 search results - page 22 / 412 » Some Applications of Coding Theory in Computational Complexi... |
IWCMC
2006
ACM
15 years 3 months ago
2006
ACM
Space time convolutional codes (STCCs) are an effective way to combine transmit diversity with coding. The computational complexity of designing STCCs generally increases exponent...
SIGSOFT
1994
ACM
15 years 1 months ago
1994
ACM
1 P2 is a scalable compiler for collection data structures. High-level ions insulate P2 users from data structure implementation details. By specifying a target data structure as a...
EUSAI
2004
Springer
15 years 3 months ago
2004
Springer
Today, most mobile devices (e.g. PDAs) are in some way associated to a fixed personal computer or server. In general this relation is only taken into account for synchronization p...
EUROCRYPT
2012
Springer
13 years 1 days ago
2012
Springer
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...
121
click to vote
ICIAP
1999
ACM
15 years 1 months ago
1999
ACM
Real-world tasks often require real-time performances. However, in many practical cases, “just in time” responses are sufficient. This means that a system should be efficien...