Matters computational ideas, algorithms, source code
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2011
|
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV037340096 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 110414s2011 xx d||| |||| 00||| eng d | ||
| 015 | |a 10,N27 |2 dnb | ||
| 016 | 7 | |a 1004070969 |2 DE-101 | |
| 020 | |a 9783642147630 |c Book w. online files/update. : ca. EUR 106.95 (freier Pr.), ca. sfr 155.50 (freier Pr.) |9 978-3-642-14763-0 | ||
| 024 | 3 | |a 9783642147630 | |
| 035 | |a (OCoLC)724294222 | ||
| 035 | |a (DE-599)DNB1004070969 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-573 | ||
| 082 | 0 | |a 518.1 |2 22/ger | |
| 082 | 0 | |a 005.1015181 |2 22/ger | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a 510 |2 sdnb | ||
| 084 | |a 004 |2 sdnb | ||
| 100 | 1 | |a Arndt, Jörg |d 1964- |e Verfasser |0 (DE-588)142015806 |4 aut | |
| 245 | 1 | 0 | |a Matters computational |b ideas, algorithms, source code |c Jörg Arndt |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2011 | |
| 300 | |a XIV, 966 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturverz. S. [931] - 950 | ||
| 650 | 0 | 7 | |a Software |0 (DE-588)4055382-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Computer |0 (DE-588)4070083-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Computer |0 (DE-588)4070083-5 |D s |
| 689 | 1 | 1 | |a Software |0 (DE-588)4055382-6 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 856 | 4 | |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3499283&prov=M&dok%5Fvar=1&dok%5Fext=htm |3 Inhaltstext | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=022493825&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-022493825 | |
Datensatz im Suchindex
| _version_ | 1819594942596513792 |
|---|---|
| adam_text | IMAGE 1
CONTENTS
LOW LEVEL ALGORITHMS 1
BIT WIZARDRY 2
1.1 TRIVIA 2
1.2 OPERATIONS ON INDIVIDUAL BITS 7
1.3 OPERATIONS ON LOW BITS OR BLOCKS OF A WORD 8
1.4 EXTRACTION OF ONES, ZEROS, OR BLOCKS NEAR TRANSITIONS 11
1.5 COMPUTING THE INDEX OF A SINGLE SET BIT 13
1.6 OPERATIONS ON HIGH BITS OR BLOCKS OF A WORD 14
1.7 FUNCTIONS RELATED TO THE BASE-2 LOGARITHM 17
1.8 COUNTING THE BITS AND BLOCKS OF A WORD 18
1.9 WORDS AS BITSETS 23
1.10 INDEX OF THE I-TH SET BIT 25
1.11 AVOIDING BRANCHES 25
1.12 BIT-WISE ROTATION OF A WORD 27
1.13 BINARY NECKLACES $ 29
1.14 REVERSING THE BITS OF A WORD 33
1.15 BIT-WISE ZIP 38
1.16 GRAY CODE AND PARITY 41
1.17 BIT SEQUENCY J 46
1.18 POWERS OF THE GRAY CODE F 48
1.19 INVERTIBLE TRANSFORMS ON WORDS F 49
1.20 SCANNING FOR ZERO BYTES 55
1.21 INVERSE AND SQUARE ROOT MODULO 2 56
1.22 RADIX -2 (MINUS TWO) REPRESENTATION 58
1.23 A SPARSE SIGNED BINARY REPRESENTATION 61
1.24 GENERATING BIT COMBINATIONS 62
1.25 GENERATING BIT SUBSETS OF A GIVEN WORD 68
1.26 BINARY WORDS IN LEXICOGRAPHIC ORDER FOR SUBSETS 70
1.27 FIBONACCI WORDS J 74
1.28 BINARY WORDS AND PARENTHESES STRINGS J 78
1.29 PERMUTATIONS VIA PRIMITIVES 80
1.30 CPU INSTRUCTIONS OFTEN MISSED 82
1.31 SOME SPACE FILLING CURVES | 83
PERMUTATIONS AND THEIR OPERATIONS 102
2.1 BASIC DEFINITIONS AND OPERATIONS 102
2.2 REPRESENTATION AS DISJOINT CYCLES 104
2.3 COMPOSITIONS OF PERMUTATIONS 105
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1004070969
DIGITALISIERT DURCH
IMAGE 2
VIII CONTENTS
2.4 IN-PLACE METHODS TO APPLY PERMUTATIONS TO DATA 109
2.5 RANDOM PERMUTATIONS I LL
2.6 THE REVBIN PERMUTATION 118
2.7 THE RADIX PERMUTATION 121
2.8 IN-PLACE MATRIX TRANSPOSITION 122
2.9 ROTATION BY TRIPLE REVERSAL 123
2.10 THE ZIP PERMUTATION 125
2.11 THE XOR PERMUTATION 127
2.12 THE GRAY PERMUTATION 128
2.13 THE REVERSED GRAY PERMUTATION 131
3 SORTING AND SEARCHING 134
3.1 SORTING ALGORITHMS 134
3.2 BINARY SEARCH 141
3.3 VARIANTS OF SORTING METHODS 142
3.4 SEARCHING IN UNSORTED ARRAYS 147
3.5 DETERMINATION OF EQUIVALENCE CLASSES 148
4 DATA STRUCTURES 153
4.1 STACK (LIFO) 153
4.2 RING BUFFER 155
4.3 QUEUE (FIFO) 156
4.4 DEQUE (DOUBLE-ENDED QUEUE) 158
4.5 HEAP AND PRIORITY QUEUE 160
4.6 BIT-ARRAY 164
4.7 LEFT-RIGHT ARRAY 166
II COMBINATORIAL GENERATION 171
5 CONVENTIONS AND CONSIDERATIONS 172
5.1 REPRESENTATIONS AND ORDERS 172
5.2 RANKING, UNRANKING, AND COUNTING 172
5.3 CHARACTERISTICS OF THE ALGORITHMS 173
5.4 OPTIMIZATION TECHNIQUES 174
5.5 IMPLEMENTATIONS, DEMO-PROGRAMS, AND TIMINGS 174
6 COMBINATIONS 176
6.1 BINOMIAL COEFFICIENTS 176
6.2 LEXICOGRAPHIC AND CO-LEXICOGRAPHIC ORDER 177
6.3 ORDER BY PREFIX SHIFTS (COOL-LEX) 180
6.4 MINIMAL-CHANGE ORDER 182
6.5 THE EADES-MCKAY STRONG MINIMAL-CHANGE ORDER 183
6.6 TWO-CLOSE ORDERINGS VIA ENDO/ENUP MOVES 186
6.7 RECURSIVE GENERATION OF CERTAIN ORDERINGS 191
7 COMPOSITIONS 194
7.1 CO-LEXICOGRAPHIC ORDER 194
7.2 CO-LEXICOGRAPHIC ORDER FOR COMPOSITIONS INTO EXACTLY K PARTS 196
7.3 COMPOSITIONS AND COMBINATIONS 198
7.4 MINIMAL-CHANGE ORDERS 199
8 SUBSETS 202
8.1 LEXICOGRAPHIC ORDER 202
8.2 MINIMAL-CHANGE ORDER 204
IMAGE 3
CONTENTS IX
8.3 ORDERING WITH DE BRUIJN SEQUENCES 208
8.4 SHIFTS-ORDER FOR SUBSETS 208
8.5 -SUBSETS WHERE K LIES IN A GIVEN RANGE 210
9 MIXED RADIX NUMBERS 217
9.1 COUNTING (LEXICOGRAPHIC) ORDER 217
9.2 MINIMAL-CHANGE (GRAY CODE) ORDER 220
9.3 GSLEX ORDER 224
9.4 ENDO ORDER 226
9.5 GRAY CODE FOR ENDO ORDER 228
9.6 FIXED SUM OF DIGITS 229
10 PERMUTATIONS 232
10.1 FACTORIAL REPRESENTATIONS OF PERMUTATIONS 232
10.2 LEXICOGRAPHIC ORDER 242
10.3 CO-LEXICOGRAPHIC ORDER 243
10.4 AN ORDER FROM REVERSING PREFIXES 245
10.5 MINIMAL-CHANGE ORDER (HEAP S ALGORITHM) 248
10.6 LIPSKI S MINIMAL-CHANGE ORDERS 250
10.7 STRONG MINIMAL-CHANGE ORDER (TROTTER S ALGORITHM) 254
10.8 STAR-TRANSPOSITION ORDER 257
10.9 MINIMAL-CHANGE ORDERS FROM FACTORIAL NUMBERS 258
10.10 DERANGEMENT ORDER 264
10.11 ORDERS WHERE THE SMALLEST ELEMENT ALWAYS MOVES RIGHT 267
10.12 SINGLE TRACK ORDERS 271
11 PERMUTATIONS WITH SPECIAL PROPERTIES 277
11.1 THE NUMBER OF CERTAIN PERMUTATIONS 277
11.2 PERMUTATIONS WITH DISTANCE RESTRICTIONS 282
11.3 SELF-INVERSE PERMUTATIONS (INVOLUTIONS) 284
11.4 CYCLIC PERMUTATIONS 285
12 /-PERMUTATIONS 291
12.1 LEXICOGRAPHIC ORDER 292
12.2 MINIMAL-CHANGE ORDER 293
13 MULTISETS 295
13.1 SUBSETS OF A MULTISET 295
13.2 PERMUTATIONS OF A MULTISET 296
14 GRAY CODES FOR STRINGS WITH RESTRICTIONS 304
14.1 LIST RECURSIONS 304
14.2 FIBONACCI WORDS 305
14.3 GENERALIZED FIBONACCI WORDS 307
14.4 RUN-LENGTH LIMITED (RLL) WORDS 310
14.5 DIGIT X FOLLOWED BY AT LEAST X ZEROS 311
14.6 GENERALIZED PELL WORDS 313
14.7 SPARSE SIGNED BINARY WORDS 315
14.8 STRINGS WITH NO TWO CONSECUTIVE NONZERO DIGITS 317
14.9 STRINGS WITH NO TWO CONSECUTIVE ZEROS 318
14.10 BINARY STRINGS WITHOUT SUBSTRINGS LXL OR LXYL 320
15 PARENTHESES STRINGS 323
15.1 CO-LEXICOGRAPHIC ORDER 323
15.2 GRAY CODE VIA RESTRICTED GROWTH STRINGS 325
IMAGE 4
X CONTENTS
15.3 ORDER BY PREFIX SHIFTS (COOL-LEX) 330
15.4 CATALAN NUMBERS 331
15.5 INCREMENT-I RGS, FC-ARY DYCK WORDS, AND FC-ARY TREES 333
16 INTEGER PARTITIONS 339
16.1 SOLUTION OF A GENERALIZED PROBLEM 339
16.2 ITERATIVE ALGORITHM 341
16.3 PARTITIONS INTO M PARTS 342
16.4 THE NUMBER OF INTEGER PARTITIONS 344
17 SET PARTITIONS 354
17.1 RECURSIVE GENERATION 354
17.2 THE NUMBER OF SET PARTITIONS: STIRLING SET NUMBERS AND BELL NUMBERS
358 17.3 RESTRICTED GROWTH STRINGS 360
18 NECKLACES AND LYNDON WORDS 370
18.1 GENERATING ALL NECKLACES 371
18.2 LEX-MIN DE BRUIJN SEQUENCE FROM NECKLACES 377
18.3 THE NUMBER OF BINARY NECKLACES 379
18.4 SUMS OF ROOTS OF UNITY THAT ARE ZERO $ 383
19 HADAMARD AND CONFERENCE MATRICES 384
19.1 HADAMARD MATRICES VIA LFSR 384
19.2 HADAMARD MATRICES VIA CONFERENCE MATRICES 386
19.3 CONFERENCE MATRICES VIA FINITE FIELDS 388
20 SEARCHING PATHS IN DIRECTED GRAPHS 391
20. 1 REPRESENTATION OF DIGRAPHS 392
20.2 SEARCHING FULL PATHS 393
20.3 CONDITIONAL SEARCH 398
20.4 EDGE SORTING AND LUCKY PATHS 402
20.5 GRAY CODES FOR LYNDON WORDS 403
III FAST TRANSFORMS 409
21 THE FOURIER TRANSFORM 410
21.1 THE DISCRETE FOURIER TRANSFORM 410
21.2 RADIX-2 FFT ALGORITHMS 411
21.3 SAVING TRIGONOMETRIC COMPUTATIONS 416
21.4 HIGHER RADIX FFT ALGORITHMS 418
21.5 SPLIT-RADIX ALGORITHM 425
21.6 SYMMETRIES OF THE FOURIER TRANSFORM 428
21.7 INVERSE FFT FOR FREE 430
21.8 REAL-VALUED FOURIER TRANSFORMS 431
21.9 MULTI-DIMENSIONAL FOURIER TRANSFORMS 437
21.10 THE MATRIX FOURIER ALGORITHM (MFA) 438
22 CONVOLUTION, CORRELATION, AND MORE FFT ALGORITHMS 440
22.1 CONVOLUTION 440
22.2 CORRELATION 444
22.3 CORRELATION, CONVOLUTION, AND CIRCULANT MATRICES % 447
22.4 WEIGHTED FOURIER TRANSFORMS AND CONVOLUTIONS 448
22.5 CONVOLUTION USING THE MFA 451
22.6 THE ^-TRANSFORM (ZT) 454
IMAGE 5
CONTENTS XI
22.7 PRIME LENGTH FFTS 457
23 THE WALSH TRANSFORM AND ITS RELATIVES 459
23.1 TRANSFORM WITH WALSH-KRONECKER BASIS 459
23.2 EIGENVECTORS OF THE WALSH TRANSFORM J: 461
23.3 THE KRONECKER PRODUCT 462
23.4 HIGHER RADIX WALSH TRANSFORMS 465
23.5 LOCALIZED WALSH TRANSFORMS 468
23.6 TRANSFORM WITH WALSH-PALEY BASIS 473
23.7 SEQUENCY-ORDERED WALSH TRANSFORMS 474
23.8 XOR (DYADIC) CONVOLUTION 481
23.9 SLANT TRANSFORM 482
23.10 ARITHMETIC TRANSFORM 483
23.11 REED-MULLER TRANSFORM 486
23.12 THE OR-CONVOLUTION AND THE AND-CONVOLUTION 489
23.13 THE MAX-CONVOLUTION T 491
23.14 WEIGHTED ARITHMETIC TRANSFORM AND SUBSET CONVOLUTION 492
24 THE HAAR TRANSFORM 497
24.1 THE STANDARD HAAR TRANSFORM 497
24.2 IN-PLACE HAAR TRANSFORM 499
24.3 NON-NORMALIZED HAAR TRANSFORMS 501
24.4 TRANSPOSED HAAR TRANSFORMS $ 503
24.5 THE REVERSED HAAR TRANSFORM | 505
24.6 RELATIONS BETWEEN WALSH AND HAAR TRANSFORMS 507
24.7 PREFIX TRANSFORM AND PREFIX CONVOLUTION 510
24.8 NONSTANDARD SPLITTING SCHEMES 512
25 THE HARTLEY TRANSFORM 515
25.1 DEFINITION AND SYMMETRIES 515
25.2 RADIX-2 FHT ALGORITHMS 515
25.3 COMPLEX FFT BY FHT 521
25.4 COMPLEX FFT BY COMPLEX FHT AND VICE VERSA 522
25.5 REAL FFT BY FHT AND VICE VERSA 523
25.6 HIGHER RADIX FHT ALGORITHMS 524
25.7 CONVOLUTION VIA FHT 525
25.8 LOCALIZED FHT ALGORITHMS 529
25.9 2-DIMENSIONAL FHTS 530
25.10 AUTOMATIC GENERATION OF TRANSFORM CODE 531
25.11 EIGENVECTORS OF THE FOURIER AND HARTLEY TRANSFORM I 533
26 NUMBER THEORETIC TRANSFORMS (NTTS) 535
26.1 PRIME MODULI FOR NTTS 535
26.2 IMPLEMENTATION OF NTTS 537
26.3 CONVOLUTION WITH NTTS 542
27 FAST WAVELET TRANSFORMS 543
27.1 WAVELET FILTERS 543
27.2 IMPLEMENTATION 544
27.3 MOMENT CONDITIONS 546
IV FAST ARITHMETIC 549
28 FAST MULTIPLICATION AND EXPONENTIATION 550
IMAGE 6
XII CONTENTS
28.1 SPLITTING SCHEMES FOR MULTIPLICATION 550
28.2 FAST MULTIPLICATION VIA FFT 558
28.3 RADIX/PRECISION CONSIDERATIONS WITH FFT MULTIPLICATION 560
28.4 THE SUM-OF-DIGITS TEST 562
28.5 BINARY EXPONENTIATION 563
29 ROOT EXTRACTION 567
29.1 DIVISION, SQUARE ROOT AND CUBE ROOT 567
29.2 ROOT EXTRACTION FOR RATIONALS 570
29.3 DIVISIONLESS ITERATIONS FOR THE INVERSE A-TH ROOT 572
29.4 INITIAL APPROXIMATIONS FOR ITERATIONS 575
29.5 SOME APPLICATIONS OF THE MATRIX SQUARE ROOT 576
29.6 GOLDSCHMIDT S ALGORITHM 581
29.7 PRODUCTS FOR THE A-TH ROOT F 583
29.8 DIVISIONLESS ITERATIONS FOR POLYNOMIAL ROOTS 586
30 ITERATIONS FOR THE INVERSION OF A FUNCTION 587
30.1 ITERATIONS AND THEIR RATE OF CONVERGENCE 587
30.2 SCHRODER S FORMULA 588
30.3 HOUSEHOLDER S FORMULA 592
30.4 DEALING WITH MULTIPLE ROOTS 593
30.5 MORE ITERATIONS 594
30.6 CONVERGENCE IMPROVEMENT BY THE DELTA SQUARED PROCESS 598
31 THE AGM, ELLIPTIC INTEGRALS, AND ALGORITHMS FOR COMPUTING TT 599
31.1 THE ARITHMETIC-GEOMETRIC MEAN (AGM) 599
31.2 THE ELLIPTIC INTEGRALS K AND E 600
31.3 THETA FUNCTIONS, ETA FUNCTIONS, AND SINGULAR VALUES 604
31.4 AGM-TYPE ALGORITHMS FOR HYPERGEOMETRIC FUNCTIONS 611
31.5 COMPUTATION OF TT 615
32 LOGARITHM AND EXPONENTIAL FUNCTION 622
32.1 LOGARITHM 622
32.2 EXPONENTIAL FUNCTION 627
32.3 LOGARITHM AND EXPONENTIAL FUNCTION OF POWER SERIES 630
32.4 SIMULTANEOUS COMPUTATION OF LOGARITHMS OF SMALL PRIMES 632
32.5 ARCTANGENT RELATIONS FOR TT J 633
33 COMPUTING THE ELEMENTARY FUNCTIONS WITH LIMITED RESOURCES 641
33.1 SHIFT-AND-ADD ALGORITHMS FOR LOG FC (A:) AND B X 641
33.2 CORDIC ALGORITHMS 646
34 NUMERICAL EVALUATION OF POWER SERIES 651
34.1 THE BINARY SPLITTING ALGORITHM FOR RATIONAL SERIES 651
34.2 RECTANGULAR SCHEMES FOR EVALUATION OF POWER SERIES 658
34.3 THE MAGIC SUMALT ALGORITHM FOR ALTERNATING SERIES 662
35 RECURRENCES AND CHEBYSHEV POLYNOMIALS 666
35.1 RECURRENCES 666
35.2 CHEBYSHEV POLYNOMIALS 676
36 HYPERGEOMETRIC SERIES 685
36.1 DEFINITION AND BASIC OPERATIONS 685
36.2 TRANSFORMATIONS OF HYPERGEOMETRIC SERIES 688
36.3 EXAMPLES: ELEMENTARY FUNCTIONS 694
IMAGE 7
CONTENTS XIII
36.4 TRANSFORMATIONS FOR ELLIPTIC INTEGRALS J 700
36.5 THE FUNCTION X X % 702
37 CYCLOTOMIC POLYNOMIALS, PRODUCT FORMS, AND CONTINUED FRACTIONS 704
37.1 CYCLOTOMIC POLYNOMIALS, MOEBIUS INVERSION, LAMBERT SERIES 704
37.2 CONVERSION OF POWER SERIES TO INFINITE PRODUCTS 709
37.3 CONTINUED FRACTIONS 716
38 SYNTHETIC ITERATIONS % 726
38.1 A VARIATION OF THE ITERATION FOR THE INVERSE 726
38.2 AN ITERATION RELATED TO THE TIME CONSTANT 730
38.3 AN ITERATION RELATED TO THE GOLAY-RUDIN-SHAPIRO SEQUENCE 731
38.4 ITERATION RELATED TO THE RULER FUNCTION 733
38.5 AN ITERATION RELATED TO THE PERIOD-DOUBLING SEQUENCE 734
38.6 AN ITERATION FROM SUBSTITUTION RULES WITH SIGN 738
38.7 ITERATIONS RELATED TO THE SUM OF DIGITS 739
38.8 ITERATIONS RELATED TO THE BINARY GRAY CODE 741
38.9 A FUNCTION ENCODING THE HUBERT CURVE 717
38.10 SPARSE POWER SERIES 750
38.11 AN ITERATION RELATED TO THE FIBONACCI NUMBERS 753
38.12 ITERATIONS RELATED TO THE PELL NUMBERS 757
V ALGORITHMS FOR FINITE FIELDS 7G3
39 MODULAR ARITHMETIC AND SOME NUMBER THEORY 764
39.1 IMPLEMENTATION OF THE ARITHMETIC OPERATIONS 764
39.2 MODULAR REDUCTION WITH STRUCTURED PRIMES 768
39.3 THE SIEVE OF ERATOSTHENES 770
39.4 THE CHINESE REMAINDER THEOREM (CRT) 772
39.5 THE ORDER OF AN ELEMENT 774
39.6 PRIME MODULUS: THE FIELD Z/PL = F P = GF(P) 776
39.7 COMPOSITE MODULUS: THE RING Z/MZ 776
39.8 QUADRATIC RESIDUES 781
39.9 COMPUTATION OF A SQUARE ROOT MODULO M 784
39.10 THE RABIN-MILLER TEST FOR COMPOSITENESS 786
39.11 PROVING PRIMALITY 792
39.12 COMPLEX MODULUS: THE FIELD GFQ? 2 ) 80 3
39.13 SOLVING THE PELL EQUATION 812
39.14 MULTIPLICATION OF HYPERCOMPLEX NUMBERS % 815
40 BINARY POLYNOMIALS 822
40.1 THE BASIC ARITHMETICAL OPERATIONS 822
40.2 MULTIPLYING BINARY POLYNOMIALS OF HIGH DEGREE 827
40.3 MODULAR ARITHMETIC WITH BINARY POLYNOMIALS 832
40.4 IRREDUCIBLE POLYNOMIALS 837
40.5 PRIMITIVE POLYNOMIALS 841
40.6 THE NUMBER OF IRREDUCIBLE AND PRIMITIVE POLYNOMIALS 843
40.7 TRANSFORMATIONS THAT PRESERVE IRREDUCIBILITY 845
40.8 SELF-RECIPROCAL POLYNOMIALS 846
40.9 IRREDUCIBLE AND PRIMITIVE POLYNOMIALS OF SPECIAL FORMS % 848
40.10 GENERATING IRREDUCIBLE POLYNOMIALS FROM LYNDON WORDS S56
40.11 IRREDUCIBLE AND CYCLOTOMIC POLYNOMIALS | 857
40.12 FACTORIZATION OF BINAR} POLYNOMIALS 858
IMAGE 8
XIV CONTENTS
41 SHIFT REGISTERS 864
41.1 LINEAR FEEDBACK SHIFT REGISTERS (LFSR) 864
41.2 GALOIS AND FIBONACCI SETUP 867
41.3 ERROR DETECTION BY HASHING: THE CRC 868
41.4 GENERATING ALL REVBIN PAIRS 873
41.5 THE NUMBER OF M-SEQUENCES AND DE BRUIJN SEQUENCES 873
41.6 AUTO-CORRELATION OF M-SEQUENCES 875
41.7 FEEDBACK CARRY SHIFT REGISTERS (FCSR) 876
41.8 LINEAR HYBRID CELLULAR AUTOMATA (LHCA) 878
41.9 ADDITIVE LINEAR HYBRID CELLULAR AUTOMATA 882
42 BINARY FINITE FIELDS: GF(2 N ) 886
42.1 ARITHMETIC AND BASIC PROPERTIES 886
42.2 MINIMAL POLYNOMIALS 892
42.3 FAST COMPUTATION OF THE TRACE VECTOR 895
42.4 SOLVING QUADRATIC EQUATIONS 896
42.5 REPRESENTATION BY MATRICES J 899
42.6 REPRESENTATION BY NORMAL BASES 900
42.7 CONVERSION BETWEEN NORMAL AND POLYNOMIAL REPRESENTATION 910
42.8 OPTIMAL NORMAL BASES (ONB) 912
42.9 GAUSSIAN NORMAL BASES 914
A THE ELECTRONIC VERSION OF THE BOOK 921
B MACHINE USED FOR BENCHMARKING 922
C THE GP LANGUAGE 923
BIBLIOGRAPHY 931
INDEX 951
|
| any_adam_object | 1 |
| author | Arndt, Jörg 1964- |
| author_GND | (DE-588)142015806 |
| author_facet | Arndt, Jörg 1964- |
| author_role | aut |
| author_sort | Arndt, Jörg 1964- |
| author_variant | j a ja |
| building | Verbundindex |
| bvnumber | BV037340096 |
| classification_rvk | ST 134 |
| ctrlnum | (OCoLC)724294222 (DE-599)DNB1004070969 |
| dewey-full | 518.1 005.1015181 |
| dewey-hundreds | 500 - Natural sciences and mathematics 000 - Computer science, information, general works |
| dewey-ones | 518 - Numerical analysis 005 - Computer programming, programs, data, security |
| dewey-raw | 518.1 005.1015181 |
| dewey-search | 518.1 005.1015181 |
| dewey-sort | 3518.1 |
| dewey-tens | 510 - Mathematics 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01963nam a2200493 c 4500</leader><controlfield tag="001">BV037340096</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">110414s2011 xx d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">10,N27</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1004070969</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642147630</subfield><subfield code="c">Book w. online files/update. : ca. EUR 106.95 (freier Pr.), ca. sfr 155.50 (freier Pr.)</subfield><subfield code="9">978-3-642-14763-0</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642147630</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)724294222</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1004070969</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-573</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518.1</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1015181</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Arndt, Jörg</subfield><subfield code="d">1964-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)142015806</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Matters computational</subfield><subfield code="b">ideas, algorithms, source code</subfield><subfield code="c">Jörg Arndt</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 966 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. [931] - 950</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Software</subfield><subfield code="0">(DE-588)4055382-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computer</subfield><subfield code="0">(DE-588)4070083-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Computer</subfield><subfield code="0">(DE-588)4070083-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Software</subfield><subfield code="0">(DE-588)4055382-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3499283&prov=M&dok%5Fvar=1&dok%5Fext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=022493825&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-022493825</subfield></datafield></record></collection> |
| id | DE-604.BV037340096 |
| illustrated | Illustrated |
| indexdate | 2024-12-24T00:59:39Z |
| institution | BVB |
| isbn | 9783642147630 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-022493825 |
| oclc_num | 724294222 |
| open_access_boolean | |
| owner | DE-573 |
| owner_facet | DE-573 |
| physical | XIV, 966 S. graph. Darst. |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Springer |
| record_format | marc |
| spellingShingle | Arndt, Jörg 1964- Matters computational ideas, algorithms, source code Software (DE-588)4055382-6 gnd Algorithmus (DE-588)4001183-5 gnd Computer (DE-588)4070083-5 gnd |
| subject_GND | (DE-588)4055382-6 (DE-588)4001183-5 (DE-588)4070083-5 |
| title | Matters computational ideas, algorithms, source code |
| title_auth | Matters computational ideas, algorithms, source code |
| title_exact_search | Matters computational ideas, algorithms, source code |
| title_full | Matters computational ideas, algorithms, source code Jörg Arndt |
| title_fullStr | Matters computational ideas, algorithms, source code Jörg Arndt |
| title_full_unstemmed | Matters computational ideas, algorithms, source code Jörg Arndt |
| title_short | Matters computational |
| title_sort | matters computational ideas algorithms source code |
| title_sub | ideas, algorithms, source code |
| topic | Software (DE-588)4055382-6 gnd Algorithmus (DE-588)4001183-5 gnd Computer (DE-588)4070083-5 gnd |
| topic_facet | Software Algorithmus Computer |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3499283&prov=M&dok%5Fvar=1&dok%5Fext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=022493825&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT arndtjorg matterscomputationalideasalgorithmssourcecode |