|
channel capacity |
2 |
|
city logistics |
2 |
|
container carriers |
2 |
|
container loading |
2 |
|
decision support system (dss) |
2 |
|
estimation theory |
2 |
|
feedback |
2 |
|
feedback channel |
2 |
|
gaussian channels |
2 |
|
gaussian processes |
2 |
|
goal programming |
2 |
|
hidden markov models |
2 |
|
information theory |
2 |
|
memory channel |
2 |
|
minimum mean-square error |
2 |
|
multi-drop constraints |
2 |
|
mutual information |
2 |
|
space amalgamation |
2 |
|
student project allocation |
2 |
|
the i-mmse relationship |
2 |
|
tree-based heuristic algorithm |
2 |
|
a-set |
1 |
|
acyclic directed networks |
1 |
|
additives |
1 |
|
analyticity |
1 |
|
awgn channels |
1 |
|
capacity |
1 |
|
central limit theorem |
1 |
|
codes over modules |
1 |
|
coding advantage |
1 |
|
colored noise |
1 |
|
complex orthogonal design |
1 |
|
concavity |
1 |
|
connectivity |
1 |
|
constrained capacity |
1 |
|
continuous alphabet |
1 |
|
continuous-time channel |
1 |
|
continuous-time systems |
1 |
|
convergence behaviors |
1 |
|
costa’s epi |
1 |
|
cutting |
1 |
|
cutting r-blocking sets |
1 |
|
decoding delay |
1 |
|
discrete-time |
1 |
|
distributed storage |
1 |
|
diversity |
1 |
|
diversity product |
1 |
|
diversity sum |
1 |
|
edge-disjoint paths |
1 |
|
encoding |
1 |
|
encoding complexity |
1 |
|
entropy |
1 |
|
entropy power inequality |
1 |
|
entropy rate |
1 |
|
entropy rates |
1 |
|
erasure channel |
1 |
|
ergodic processes |
1 |
|
ergodics |
1 |
|
factor codes |
1 |
|
feedback amplifiers |
1 |
|
finite-state |
1 |
|
finite-state channel |
1 |
|
finite-state channels |
1 |
|
finite-to-one codes |
1 |
|
flash memory channels |
1 |
|
gaussian channel |
1 |
|
gaussian noise |
1 |
|
generalized rank weights |
1 |
|
graph structure |
1 |
|
graph theoretical approach |
1 |
|
group of isometries |
1 |
|
hidden |
1 |
|
hidden markov chain |
1 |
|
hidden markov chains |
1 |
|
hidden markov model |
1 |
|
hidden markov process |
1 |
|
hilbert metric |
1 |
|
input constraint |
1 |
|
k-pair network |
1 |
|
limit theorem |
1 |
|
limiting |
1 |
|
locally repairable codes |
1 |
|
macwilliams extension property |
1 |
|
markov capacity |
1 |
|
memory |
1 |
|
menger’s path |
1 |
|
menger’s theorem |
1 |
|
merging |
1 |
|
minimal length of codes |
1 |
|
multi-flow |
1 |
|
multicast network |
1 |
|
multiflow |
1 |
|
multiple antennas |
1 |
|
multiple commodity flow |
1 |
|
multiple pairs |
1 |
|
multiple unicast conjecture |
1 |
|
multiple unicast network |
1 |
|
multiple unicast network coding conjecture |
1 |
|
mutual information rate |
1 |
|
network coding |
1 |
|
network flow theory |
1 |
|
nonsmooth optimization |
1 |
|
optimization |
1 |
|
orthogonal designs |
1 |
|
parallel recovery |
1 |
|
peak-to-average power ratio (papr) |
1 |
|
phase-shift keying (psk) |
1 |
|
r-minimal codes |
1 |
|
random variables |
1 |
|
rank metric codes |
1 |
|
rényi entropy rate |
1 |
|
sampling theorem |
1 |
|
sequential recovery |
1 |
|
shannon-mcmillan-breiman theorem |
1 |
|
shift of finite type |
1 |
|
space-time block code |
1 |
|
space-time coding |
1 |
|
space-time constellations |
1 |
|
stacking method |
1 |
|
symbolic dynamics |
1 |
|
transceiver signal linearization |
1 |
|
vertex-disjoint paths |
1 |
|
weighted poset metric |
1 |
