164 search results - page 7 / 33 » Improved upper bounds on sizes of codes |
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
Let ( ) denote the maximum size of a -ary code of length and distance . We study the minimum asymptotic redundancy ( ) = log ( ) as grows while and are fixed. For any and 1, long a...
ICCAD
2000
IEEE
15 years 1 months ago
2000
IEEE
For data dominated applications, the system level design trajectory should first focus on finding a good data transfer and storage solution. Since no realization details are avail...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that ...
88
Voted
LOPSTR
2004
Springer
15 years 2 months ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...