Name
Abstract | ||
|---|---|---|
A code C⊆Zn2, where Z2={0,1}, has unidirectional covering radius R if R is the smallest integer so that any word in Zn2 can be obtained from at least one codeword c∈C by replacing either 1s by 0s in at most R coordinates or 0s by 1s in at most R coordinates. The minimum cardinality of such a code is denoted by E(n,R). Upper bounds on this function are here obtained by constructing codes using tabu search; lower bounds, on the other hand, are mainly obtained by integer programming and exhaustive search. Best known bounds on E(n,R) for n≤13 and R≤6 are tabulated. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/TIT.2005.860449 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
tabu search,code c,smallest integer,exhaustive search,radius r,integer programming,lower bound,upper bound,minimum cardinality,binary codes | Integer,Discrete mathematics,Combinatorics,Brute-force search,Binary code,Cardinality,Coding theory,Integer programming,Code word,Tabu search,Mathematics | Journal |
Volume | Issue | ISSN |
52 | 1 | 0018-9448 |
Citations | PageRank | References |
2 | 0.51 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Patric R. J. Östergård | 1 | 92 | 12.09 |
| E. A. Seuranen | 2 | 2 | 0.51 |