Search Results - "ØSTERGARD, P"

The Perfect Binary One-Error-Correcting Codes of Length 15: Part I-Classification by Ostergard, P., Pottonen, O.

“…A complete classification of the perfect binary one-error-correcting codes of length 15 as well as their extensions of length 16 is presented. There are 5983…”
Get full text

On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16 by Ostergard, P. R. J.

“…Let A ( n , d ) denote the maximum size of a binary code with length n and minimum distance d . It has been known for decades that A (16,7) = A (17,8) = 36 or…”
Get full text

The nonexistence of a (K6-e)-decomposition of the complete graph K29 by Hartke, S. G., Östergård, P. R. J., Bryant, D., El-Zanati, S. I.

“…We show via an exhaustive computer search that there does not exist a (K6−e)‐decomposition of K29. This is the first example of a non‐complete graph G for…”
Get full text

The nonexistence of a ( K 6 ‐ e )‐decomposition of the complete graph K 29 by Hartke, S. G., Östergård, P. R. J., Bryant, D., El‐Zanati, S. I.

“…We show via an exhaustive computer search that there does not exist a ( K 6 − e )‐decomposition of K 29 . This is the first example of a non‐complete graph G…”
Get full text

Packing up to 50 Equal Circles in a Square by Nurmela, K. J., Östergård, P. R. J.

Get full text

A New Algorithm for the Maximum-Weight Clique Problem by OSTERGARD, P

Get full text

Copenhagen Community Psychiatric Project (CCPP) : characteristics and treatment of homeless patients in the psychiatric services after introduction of community mental health centres by NORDENTOFT, M, KNUDSEN, H. C, JESSEN-PETERSEN, B, KRASNIK, A, SAELAN, H, BRODERSEN, A. M, TREUFELDT, P, LØPPENTHIN, P, SAHL, I, ØSTERGARD, P

“…The main purpose of the study was to describe the characteristics of homeless psychiatric patients, and to compare the treatment they are offered to that…”
Get full text

Classification of Binary Constant Weight Codes by Ostergard, P R J

“…A binary code C ⊆ F 2 n with minimum distance at least d and codewords of Hamming weight w is called an (n , d , w ) constant weight code. The maximum size of…”
Get full text

On Optimal Binary One-Error-Correcting Codes of Lengths 2^sup m ^ -4 and 2^sup m^ -3 by Krotov, D S, Ostergard, P R J, Pottonen, O

“…Best and Brouwer proved that triply-shortened and doubly-shortened binary Hamming codes (which have length $2^{m}-4$ and $2^{m}-3$, respectively) are optimal…”
Get full text

The Perfect Binary One-Error-Correcting Codes of Length15: Part I - Classification by Ostergard, P R J, Pottonen, O

“…A complete classification of the perfect binary one-error-correcting codes of length 15 as well as their extensions of length $16 is presented. There are 5983…”
Get full text

Further results on (k, t)-subnormal covering codes by Ostergard, P.R.J.

“…The concept of (k, t)-subnormal covering codes, is discussed generalizing some of the earlier results. In a similar way, (k, t)-normal covering codes are…”
Get full text

A new binary code of length 10 and covering radius 1 by Ostergard, P.R.J.

“…A mixed code of covering radius 1 that has 60 codewords is constructed. This code is then used to show that K(10,1)<or=120.< >…”
Get full text

There exists no Hermitian self-dual quaternary 26, 13, 10(4) code by Ostergard, P R J

“…Hermitian self-dual quaternary codes exist for all even lengths. The smallest length for which the maximum possible minimum distance of such codes is…”
Get full text

On Optimal Binary One-Error-Correcting Codes of Lengths 2^-4 and 2^-3 by Krotov, D. S., Ostergard, P. R. J., Pottonen, O.

“…Best and Brouwer proved that triply-shortened and doubly-shortened binary Hamming codes (which have length 2 m -4 and 2 m -3, respectively) are optimal…”
Get full text

Reconstructing Extended Perfect Binary One-Error-Correcting Codes From Their Minimum Distance Graphs by Mogilnykh, I.Yu, Ostergard, P.R.J., Pottonen, O., Solov'eva, F.I.

“…The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum…”
Get full text

A new bound for the zero-error capacity region of the two-user binary adder channel by Mattas, M., Ostergard, P.R.J.

“…A new uniquely decodable (UD) code pair for the two-user binary adder channel (BAC) is presented. This code pair leads to an improved bound for the zero-error…”
Get full text

New Uniquely Decodable Codes for the T-User Binary Adder Channel With 3 \le T \le 5 by Kiviluoto, L., Ostergard, P.R.J.

“…New uniquely decodable (UD) codes for 3-, 4-, and 5-user binary adder channels are obtained in a computer search. These codes improve the highest known rate of…”
Get full text

Dense packings of congruent circles in a circle by Graham, R.L., Lubachevsky, B.D., Nurmela, K.J., Östergård, P.R.J.

“…The problem of finding packings of congruent circles in a circle, or, equivalently, of spreading points in a circle, is considered. Two packing algorithms are…”
Get full text

Optimal quaternary linear rate-1/2 codes of length /les/18 by Gulliver, T A, Ostergard, P R J, Senkevitch, N I

“…We classify all optimal linear [n,n/2,d] codes over F(4) up to length 18. In particular, we show that there is a unique optimal [12,6,6] code and three optimal…”
Get full text

Bounds and constructions for ternary constant-composition codes by Svanstrom, M., Ostergard, P.R.J., Bogdanova, G.T.

“…The problem of determining the maximum size of a ternary code is considered, under the restriction that each symbol should appear a given number of times in…”
Get full text