412 search results - page 45 / 83 » New Set of Codes for the Maximum-Likelihood Decoding Problem |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Current medium access control mechanisms are based on collision avoidance and collided packets are discarded. The recent work on ZigZag decoding departs from this approach by recov...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
AAECC
2006
Springer
14 years 9 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
107
click to vote
SDM
2011
SIAM
14 years 16 days ago
2011
SIAM
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— We consider the problem of minimizing the resources used for network coding while achieving the desired throughput in a multicast scenario. Since this problem is NPhard...