Sciweavers

886 search results - page 88 / 178
» Generalized Bezout Identity
Sort
View
COR
2010
164views more  COR 2010»
13 years 9 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 9 months ago
Secure Transmission with Multiple Antennas II: The MIMOME Wiretap Channel
The capacity of the Gaussian wiretap channel model is analyzed when there are multiple antennas at the sender, intended receiver and eavesdropper. The associated channel matrices a...
Ashish Khisti, Gregory W. Wornell
CORR
2008
Springer
87views Education» more  CORR 2008»
13 years 9 months ago
The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
Tal Philosof, Ram Zamir
CORR
2008
Springer
124views Education» more  CORR 2008»
13 years 9 months ago
Scheduling Kalman Filters in Continuous Time
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
Jerome Le Ny, Eric Feron, Munther A. Dahleh
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 9 months ago
On formulas for decoding binary cyclic codes
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
Daniel Augot, Magali Bardet, Jean-Charles Faug&egr...