Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Hedayat A.S., Sloane N.J.A., Stufken J. — Orthogonal Arrays: Theory and Applications
Hedayat A.S., Sloane N.J.A., Stufken J. — Orthogonal Arrays: Theory and Applications

Читать книгу
бесплатно

Скачать книгу с нашего сайта нельзя

Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Orthogonal Arrays: Theory and Applications

Авторы: Hedayat A.S., Sloane N.J.A., Stufken J.

Аннотация:

This is the first book on the subject since its introduction more than fifty years ago, and it can be used as a graduate text or as a reference work. It features all of the key results, many very useful tables, and a large number of research problems. The book will be of interest to those interested in one of the most fascinating areas of discrete mathematics, connected to statistics and coding theory, with applications to computer science and cryptography. It will be useful for anyone who is running experiments, whether in a chemistry lab or a manufacturing plant (trying to make those alloys stronger), or in agricultural or medical research. Sam Hedayat is Professor of Statistics and Senior Scholar in the Department of Mathematics, Statistics, and Computer Science, University of Illinois, Chicago. Neil J.A. Sloane is with AT&T Bell Labs (now AT&T Labs). John Stufken is Professor Statistics at Iowa State University.


Язык: en

Рубрика: Математика/Алгебра/Комбинаторика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1999

Количество страниц: 416

Добавлена в каталог: 11.03.2005

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
(t, s,m)-net      244
(u, u + v) construction      111 225 324
Abel and Cheng      140 243
Abel, Brouwer, Colbourn and Dinitz      172 194 339
Abel, Colbourn and Dinitz      195
Abelian group      113 342
Abramowitz and Stegun      254 355
Abt and Pukelsheim      302
Addelman      206
Addelman and Kempthorne      37 44 45 47 83 126 127 199 206 289 293 322
Addelman-Kempthorne construction      44 83 126 127
Additive      44
Agaian      164
Agaian and Sarukhanyan      166
Agrawal and Dey      331
Algebraic geometry code      108
Alias matrix      314
Alias relationship      279
Alphabet      61
Alternant code      108
Assemblies      2 248
Assmus and Key      101 110 156
Asymmetrical orthogonal array      6
Asymptotic bounds      228
Atkinson and Donev      163
atom      335
Atsumi      245
Automorphism group      165
Baker, van Lint and Wilson      102
Balanced array      303
Balanced orthogonal multi-array      236
Banerjee      163
Bannai and Ito      245
Baumert and McEliece      81
BCH code      93 323
Beder      33
Bennett, Brassard and Robert      244
Berlekamp      89 108
Beth, Jungnickel and Lenz      140 141 163 173 242 339
Bias matrix      314
Bierbrauer      244
Bierbrauer and Edel      323
Bierbrauer, Gopalakrishnan and Stinson      80 244
Binary code      63
Blanchard      229
Block      242
Blokh and Zyablov      323
Blokhuis, Bruen and Thas      108
Blum, Schatz and Seiden      27 30
Bose      xv 61 65 98 102 192
Bose and Bush      17 18 20 21 37 113 122 123 127 322
Bose and Ray-Chaudhuri      93
Bose and Shrikhande      171
Bose, Shrikhande and Parker      171
Bound      96
Bound, asymptotic      228
Bound, Friedman      80
Bound, Gilbert — Varshamov      229
Bound, Griesmer      81
Bound, Hamming      33 78
Bound, linear programming      see linear programming bound
Bound, McEliece et al.      229
Bound, Plotkin      80
Bound, Rao      see Rao inequalities
Bound, Singleton      79
Bound, sphere-packing      33 78
box      xvi
Box and Draper      247 303
Box and Hunter      286
Box and Meyer      302
Box, Bisgaard and Fung      302
Box, Hunter and Hunter      308
Brouwer      81 171 195 323 339
Brouwer and Verhoeff      339
Brouwer, Hamalainen, Ostergard and Sloane      339
Brown, Hedayat and Parker      172
Bruck      170
Bruen, Thas and Blokhuis      108
Buratti      243
Bush      4 24 37 38 82 96 322
Butson      140 141
Calderbank and Goethals      245
Calderbank and Kantor      102 108
Cameron and van Lint      83
Camion and Canteaut      244
Camion, Carlet, Charpin and Sendrier      244
Casse      98
Ceccherini and Tallini      108
Central composite design      303
Chacko, Dey and Ramakrishna      331
Chadjipantelis, Kounias and Moyssiadis      164
Chakravarti      xvi
Chakravarty and Dey      27
Characteristic of field      343
Chebyshev polynomials      254
Chen and Hedayat      306
Chen and Lin      304
Cheng      304 306 307
Cheng and Sloane      323
Cheng and Steinberg      307
Cheng, Steinberg and Sun      306
Chipman and Hamada      307
Chopra      27 29
Chor et al.      244
Chvatal      72 76
Circulant      154
Clayman et al.      245
Cochran and Cox      247
Code      xi 61
Code, algebraic geometry      108
Code, alternant      108
Code, BCH      93 323
Code, binary      63
Code, constacyclic      90
Code, Delsarte — Goethals      102
Code, dual      64 276
Code, e-error-correcting      62
Code, error-correcting      61
Code, extended      88
Code, Golay      99
Code, Hamming      49 63 91
Code, isomorphic      67
Code, Kerdock      102
Code, linear      63 276
Code, maximal distance separable      see code MDS
Code, MDS      43 79 96 338
Code, nonlinear      67
Code, Nordstrom — Robinson      102 244
Code, quadratic residue      99 107
Code, quantum      84
Code, quasicyclic      90
Code, quaternary      63
Code, Reed — Muller      100
Code, Reed — Solomon      95
Code, relation      277
Code, repetition      85
Code, simple      62
Code, Srivastava      108
Code, ternary      63
Code, two-weight      108
Code, zero-sum      85
Code,Cyclic      88
Codewords      41 61
Colbourn      222 242 243
Colbourn and De Launey      140
Colbourn and Dinitz      164 245
Colbourn and Kreher      138 140
Colbourn, Dinitz and Stinson      244
Combined array      301
Common parallel transversals      172
Complement      5
Complement of perpendicular array      133
Complenientable perpendicular array      133
Complete factorial      248
Complete orthogonal array      16
Complete set of pairwise orthogonal F-squares      176
Complete set of pairwise orthogonal Latin squares      169
Completely resolvable      119
complexity      336
Component of a main-effect      253
Component of an interaction      253
Compound orthogonal array      230
Computer science      vii 243
Computer search      336
Condition of proportional frequencies      290
Conference matrix      152
Confounding factorial effects with blocks      285
Constacyclic code      90
Constantine      163
Construction, (u, u + v)      111 225 324
Construction, Addelmaii — Kenipthorne      44 83 126 127
Construction, Bush      38 96
Construction, Hamming — Rao      49
Construction, juxtaposition      224 323
Construction, Paley      152
Construction, Rao — Hamming      49
Construction, X4      226
Contractive replacement method      204
contrast      250
Control factor      299
Conway and Sloane      99 105 107
Coster      307
Covering design      304
Covering radius      84
Cox      247
Cryptography      vii 243
Currin et al.      306
Cyclic code      88 323
Cyclotomic coset      356
Dalai and Mallows      304
Dawson      140 141
De Launey      140 141
Deficiency of a POL(s,w)      170
Degrees of freedom      265
Delsarte      xi 61 66 69—73 77 78 80 83 84 245
Delsarte and Goethals      102
Delsarte and Levenshtein      80
Dembowski      102
Denes and Keedwell      26 167 173
Denning contrast      276
Denning relation      272 275 276
Design, covering      304
Design, factorial      247
Design, t-independent      304
Design, t-surjective      304
Determinant, maximal      145 163
Developing a difference scheme      118
Dey      206 293 330 339
Dey and Midha      206 208 329
Dey and Ramakrishna      331
diamond      164
Difference scheme      xi 113 206 323 338
Difference scheme of strength t      136
Difference scheme, developing      118
Difference scheme, Hadamard      148
Difference scheme, resolvable      114
Dillon, Ferragut and Gealy      181
DIMENSION      40
Dimension of a code      63 276
Dinitz and Stinson      173
Distance, Hamming      62
Distance, minimal      62 276
Dodecacode      107
Dodunekov and Manev      81
Double circulant code      324
Doyen and Rosa      339
Drake      140 141
Drug testing      x
Dual array      65
Dual atom      335
Dual code      64 276
Dual distance      65 69 70
Dual weight distribution      69
Dual, formal      98
Dual, linear programming bound      75
Duckworth      84 306
Dulmage, Johnson and Mendelsohn      117 140 141
Dunietzet al.      304
Eades and Hain      163
Edel-Bierbraner      323
Ehlich      164
Ehlich and Zeller      164
Ehrenfeld      163
Elkies      84
Engel      302 312
Engel and Huele      302 312
Equivalent Hadamard matrices      147
Equivalent Latin squares      169
Erdelyi      254
Error-correcting code      41 61
Estimable      251
Estimation capacity      306
Euler      170 195
Euler conjecture      170
Expansive replacement method      203
Extended Reed — Solomon codes      41
Extension field      351
F-square      173
F-squares, complete set of      176
F-squares, mutually orthogonal      174
F-squares, orthogonal      174
F-squares, pairwise orthogonal      174 338
Factor      1
Factor control      299
Factor, levels of      1
Factor, noise      299
Factor, qualitative      248
Factor, quantitative      248
Factor, symbols for      1
Factorial experiment      247
Farmakis      163
Federer      179
Field      341
Field, Galois      xi 342
Fields, isomorphic      350
Finney      49 182 330
Fisher and Yates      254
Fixed-level orthogonal array      199
Forney, Sloane and Trott      102 324
Fourer, Gay and Kernigham      78
FRACTION      see fractional factorial
Fractional factorial      248 254 339
Franklin      171
Frequency square      173
Friedman bound      80
Friedman, J.      80 244
Friedman, J.H.      306
Fuji-Hara      337
Fujii, Namikawa and Yamamoto      22 109 323
Galil      163
Galil and Kiefer      163
Galois field      xi 342
Ganter, Mathon and Rosa      172
Generalized Hadamard matrix      115
Generalized interaction      277
Generating contrast      285
Generating vector      88
Generator matrix      40 64 276
Generator polynomial      89
Gilbert      229
1 2 3
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2017
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте