716 search results - page 18 / 144 » Algorithmic Issues in Coding Theory |
110
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
139
click to vote
INFOCOM
2012
IEEE
13 years 4 months ago
2012
IEEE
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
120
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rank-metric codes. This result allows many of the too...
111
Voted
DCC
2006
IEEE
16 years 1 months ago
2006
IEEE
Abstract. We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions...
121
click to vote
AAECC
2002
Springer
15 years 2 months ago
2002
Springer
Abstract. For any integral convex polytope in R2 there is an explicit construction of an error-correcting code of length (q - 1)2 over the finite field Fq, obtained by evaluation o...