77 search results - page 3 / 16 » Near-MDS codes over some small fields |
CSCW
2004
ACM
13 years 8 months ago
2004
ACM
Small-scale classification schemes are used extensively in the coordination of cooperative work. This study investigates the creation and use of a classification scheme for handlin...
ASIACRYPT
2000
Springer
14 years 28 days ago
2000
Springer
The paper shows that some of elliptic curves over finite fields of characteristic three of composite degree are attacked by a more effective algorithm than Pollard’s ρ method...
TIT
2011
13 years 3 months ago
2011
—The fundamental result of linear network coding asserts the existence of optimal codes over acyclic networks when the symbol field is sufficiently large. The restriction to just...
ALENEX
2003
13 years 10 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Agile recovery from link failures in autonomic communication networks is essential to increase robustness, accessibility, and reliability of data transmission. However, this must b...