175 search results - page 12 / 35 » Bounds for Permutation Rate-Distortion |
ISAAC
2001
Springer
15 years 3 months ago
2001
Springer
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
68
Voted
TIT
2010
14 years 6 months ago
2010
The theory of Markov set-chains is applied to derive upper and lower bounds on the capacity of finite-state channels that are tighter than the classic bounds by Gallager. The new ...
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
— Optical Burst Switching (OBS) is an experimental network technology that enables the construction of very high capacity routers, using optical data paths and electronic control...
TIT
2010
14 years 6 months ago
2010
We investigate error-correcting codes for a the rank-modulation scheme with an application to flash memory devices. In this scheme, a set of n cells stores information in the permu...
101
click to vote
WG
2005
Springer
15 years 4 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...