119 search results - page 1 / 24 » Bounds on Codes Based on Graph Theory |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
ISSAC
2007
Springer
13 years 10 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
LION
2009
Springer
13 years 11 months ago
2009
Springer
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...
ASIACRYPT
2009
Springer
13 years 11 months ago
2009
Springer
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...