17951 search results - page 122 / 3591 » Network Coding Applications |
347
click to vote
CRYPTO
2000
Springer
15 years 10 months ago
2000
Springer
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
145
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The order bound for the minimum distance of algebraic geometry codes is defined for the dual of one-point codes. A new bound for the minimum distance of linear codes, and for codes...
169
click to vote
CODES
2003
IEEE
16 years 2 days ago
2003
IEEE
Current methods cannot synthesize real-time embedded software applications when the global deadline of a task is shorter than the total of all local deadlines along a critical pat...