498 search results - page 11 / 100 » New Constructions for IPP Codes |
IPPS
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
CORR
2010
Springer
15 years 4 days ago
2010
Springer
Several new applications and a number of new mathematical techniques have increased the research on errorcorrecting codes in the Lee metric in the last decade. In this work we cons...
FFA
2007
15 years 1 months ago
2007
We present a new construction for (n, w, λ)-optical orthogonal codes (OOCs). The construction is pleasingly simple, where codewords correspond to arcs, specifically normal ratio...
CORR
2010
Springer
15 years 1 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...