AAECC
2006
Springer
13 years 5 months ago
2006
Springer
We describe a complete algorithm to compute the hypergeometric solutions of linear recurrence relations with rational function coefficients. We use the notion of finite singularit...
AAECC
2006
Springer
13 years 5 months ago
2006
Springer
AAECC
2006
Springer
13 years 6 months ago
2006
Springer
AAECC
2006
Springer
13 years 8 months ago
2006
Springer
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the "doping" of standard LDPC (proto-)graphs,...
AAECC
2006
Springer
13 years 11 months ago
2006
Springer
The Fujisaki-Okamoto (FO) conversion is widely known to be able to generically convert a weak public key encryption scheme, say one-way against chosen plaintext attacks (OW-CPA), t...
AAECC
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially ...
AAECC
2006
Springer
13 years 11 months ago
2006
Springer
Abstract Dirty paper coding are relevant for wireless networks, multiuser channels, and digital watermarking. We show that the problem of dirty paper is essentially equivalent to s...
AAECC
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We consider the problem of determining the period of a binary sequence. For sequences with small autocorrelation we prove the existence of a polynomial time quantum algor...
AAECC
2006
Springer
13 years 11 months ago
2006
Springer
This paper addresses the problem of threshold traitor tracing for digital content where, by embedding appropriate digital patterns into the distributed content, it is possible to t...
AAECC
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper compares two approaches to reliable communication over fading channels using low-density parity check (LDPC) codes. The particular model considered is the bloc...