Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-10
|
Results: 10
Improved bounds for ternary linear codes of dimension 8 using tabu search
Authors:
Gulliver, TA Ostergard, PRJ
Citation:
Ta. Gulliver et Prj. Ostergard, Improved bounds for ternary linear codes of dimension 8 using tabu search, J HEURISTIC, 7(1), 2001, pp. 37-46
Error-correcting codes over an alphabet of four elements
Authors:
Bogdanova, GT Brouwer, AE Kapralov, SN Ostergard, PRJ
Citation:
Gt. Bogdanova et al., Error-correcting codes over an alphabet of four elements, DES CODES C, 23(3), 2001, pp. 333-342
On the size of optimal binary codes of length 9 and covering radius 1
Authors:
Ostergard, PRJ Blass, U
Citation:
Prj. Ostergard et U. Blass, On the size of optimal binary codes of length 9 and covering radius 1, IEEE INFO T, 47(6), 2001, pp. 2556-2557
Linear codes with covering radius R=2, 3 and codimension tR
Authors:
Davydov, AA Ostergard, PRJ
Citation:
Aa. Davydov et Prj. Ostergard, Linear codes with covering radius R=2, 3 and codimension tR, IEEE INFO T, 47(1), 2001, pp. 416-421
New quaternary linear codes with covering radius 2
Authors:
Davydov, AA Ostergard, PRJ
Citation:
Aa. Davydov et Prj. Ostergard, New quaternary linear codes with covering radius 2, FINITE F T, 6(2), 2000, pp. 164-174
Covering t-sets with (t+2)-sets
Authors:
Nurmela, KJ Ostergard, PRJ
Citation:
Kj. Nurmela et Prj. Ostergard, Covering t-sets with (t+2)-sets, DISCR APP M, 95(1-3), 1999, pp. 425-437
New linear codes with covering radius 2 and odd basis
Authors:
Davydov, AA Ostergard, PRJ
Citation:
Aa. Davydov et Prj. Ostergard, New linear codes with covering radius 2 and odd basis, DES CODES C, 16(1), 1999, pp. 29-39
Constructing covering codes with given automorphisms
Authors:
Ostergard, PRJ Weakley, WDU
Citation:
Prj. Ostergard et Wdu. Weakley, Constructing covering codes with given automorphisms, DES CODES C, 16(1), 1999, pp. 65-73
More optimal packings of equal circles in a square
Authors:
Nurmela, KJ Ostergard, PRJ
Citation:
Kj. Nurmela et Prj. Ostergard, More optimal packings of equal circles in a square, DISC COM G, 22(3), 1999, pp. 439-457
Optimal binary one-error-correcting codes of length 10 have 72 codewords
Authors:
Ostergard, PRJ Baicheva, T Kolev, E
Citation:
Prj. Ostergard et al., Optimal binary one-error-correcting codes of length 10 have 72 codewords, IEEE INFO T, 45(4), 1999, pp. 1229-1231
Risultati:
1-10
|