134 search results - page 3 / 27 » A New Tight Upper Bound on the Transposition Distance |
BMCBI
2006
14 years 9 months ago
2006
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
TIT
2002
14 years 9 months ago
2002
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...
TCOM
2010
14 years 4 months ago
2010
Abstract--Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in the presence of noisy channels. Addressing this problem with joint sour...
104
click to vote
DMTCS
2010
14 years 7 months ago
2010
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper, we manage to prove the log-concavity of the generalized Marcum Q-function Qν (a, b) with respect to its order ν on [1, ∞). The proof relies on a powerful math...