498 search results - page 16 / 100 » New Constructions for IPP Codes |
ISSAC
2007
Springer
15 years 8 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...
DAGSTUHL
2006
15 years 3 months ago
2006
Abstract. Code "clones" are similar segments of code that are frequently introduced by "scavenging" existing code, that is, reusing code by copying it and adapt...
109
click to vote
DM
2008
15 years 1 months ago
2008
We present new constructions for (n, w, ) optical orthogonal codes (OOC) using techniques from finite projective geometry. In one case codewords correspond to (q - 1)-arcs contain...
STOC
1995
ACM
15 years 5 months ago
1995
ACM
We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmic-d...
109
click to vote
COMBINATORICS
2007
15 years 1 months ago
2007
New cyclic n-digit Gray codes are constructed over {0, 1, . . . , R−1} for all R ≥ 3, n ≥ 2. These codes have the property that the distribution of the digit changes (transi...