Name
Abstract | ||
|---|---|---|
Upper and lower bounds are presented for the maximal possible size of mixed binary/ternary error-correcting codes. A table up to length 13 is included. The upper bounds are obtained by applying the linear programming bound to the product of two association schemes. The lower bounds arise from a number of different constructions |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/18.651001 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
ternary error-correcting code,ternary code,linear programming,different construction,association scheme,mixed binary,maximal possible size,lower bound,upper bound,linear program,association schemes,hamming distance,vectors,error correction code,computer science,upper and lower bounds,binary codes,mathematics | Discrete mathematics,Combinatorics,Association scheme,Upper and lower bounds,Ternary operation,Error detection and correction,Linear programming,Mathematics,Tabu search,Binary number | Journal |
Volume | Issue | ISSN |
44 | 1 | 0018-9448 |
Citations | PageRank | References |
35 | 3.88 | 21 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. E. Brouwer | 1 | 35 | 3.88 |
| H. O. Hamalainen | 2 | 51 | 6.55 |
| Patric R. J. Östergård | 3 | 92 | 12.09 |
| N. J.A. Sloane | 4 | 1107 | 370.21 |