56 search results - page 4 / 12 » dcc 2004 |
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
A Latin square L = L( ij) over the set S = {0, 1, . . . , n - 1} is called totally non-polynomial over Zn iff
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
We construct an infinite family of symplectic spreads in spaces of odd rank and characteristic.
DCC
2004
IEEE
13 years 11 months ago
2004
IEEE
This paper addresses the issue of robust and joint source-channel decoding of quasiarithmetic codes. Quasi-arithmetic coding is a reduced precision and complexity implementation o...
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
We address the problem of signal compression, basing on the mathematical model, in which a set of all possible signals is considered as a function space with a metric . The main a...
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
Inspired by a converse result, the concept of "probabilistically matched" sources and channels is extended to sources subject to multiresolution coding and degraded broa...