Capocelli | Sequences | Buch | 978-1-4612-7977-8 | sack.de

Buch, Englisch, 549 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 844 g

Capocelli

Sequences

Combinatorics, Compression, Security, and Transmission
Softcover Nachdruck of the original 1. Auflage 1990
ISBN: 978-1-4612-7977-8
Verlag: Springer US

Combinatorics, Compression, Security, and Transmission

Buch, Englisch, 549 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 844 g

ISBN: 978-1-4612-7977-8
Verlag: Springer US


This volume contains all of the papers presented at the "Advanced In ternational Workshop on Sequences: Combinatorics, Compression, Se curity, and Transmission" held Monday June 6 through Saturday June 11, 1988 at the Palazzo Serra di Cassano in Naples and at the Hotel Covo dei Saraceni in Positano, Italy. The event was organized by the Departimento di Informatica ed Ap plicazioni of the University of Salerno in cooperation with the Istituto Italiano per gli Studi Filosofici of Naples and the National Research Council of Italy (C.N.R.). I wish to express my warmest thanks to the members of the Program Committee: Professor B. Bose, Professor S. Even, Professor Z. Galil, Professor A. Lempel, Professor A. Restivo; and to my collaborators: Professor F. De Santis and Professor U. Vaccaro; for their effective, ceaseless help both during the organization of the workshop and dur ing the preparation ofthis volume. Finally, I would like to express my sincere gratitude to all the participants in the Workshop.

Capocelli Sequences jetzt bestellen!

Zielgruppe


Research


Autoren/Hrsg.


Weitere Infos & Material


Combinatorial Algorithms.- Fast Parallel and Serial Multidimensional Approximate Array Matching.- Context-Dependent String Matching.- Constant-Space String-Matching.- Matching Patterns in Strings Subject to Multi-Linear Transformations.- Efficient Algorithms with Applications to Molecular Biology.- A Survey of Approximation Algorithms for the Permanent.- On Optimal Parallel Computations for Sequences of Brackets.- Combinatorics.- Universal Sequences and Graph Cover Times: A Short Survey.- Fibonacci Facts and Formulas.- On the Influence of Single Participant in Coin Flipping Schemes.- Zero-Error Capacities and Very Different Sequences.- Sequences of Lyndon Words.- A Note on Addition Chains and Some Related Conjectures.- Some Applications of Probability Methods to Number Theory. Successes and Limitations.- On Pseudo-Random Arrays Constructed from Patterns with Distinct Differences.- Combinatorial Designs Derived from Costas Arrays.- Algorithms for Determining Relative Star-Height and Star-Height.- Eigenwords and Periodic Behaviors.- Infinite Words and a Problem in Semigroup Theory.- Some Combinatorial Properties of Factorial Languages.- A Conjecture on Rational Sequences.- Sequences Defined by Iterated Morphisms.- Encoding the Vertices of a Graph with Binary Edge Labels.- Compression.- Applications of DAWGs to Data Compression.- Coding and Complexity.- Compression of Pictures by Finite State Encoders.- Lossy On-Line Dynamic Data Compression.- A Comparison of Text Compression Algorithms.- Compression, Tests for Randomness and Estimating the Statistical Model of an Individual Sequence.- Security.- Removing Interaction from Zero-Knowledge Proofs.- Protecting Against Abuses of Cryptosystems in Particular in the Context of Verification of Peace Treaties.- The Information Dispersal Algorithm and Its Applications.- Three Types of Perfection in Shannon-Theoretic Cryptography.- Transmission.- Codes for Certain Sofic Systems.- Simple Combinatorial Decoding of the [23,12,7] Golay Code.- Flag Encodings Related to the Zeckendorf Representation of Integers.- Immutable Codes.- Unison in Distributed Networks.- Sequence Transmission: Coding in the Frequency Domain.- On the Maximality of the Group Theoretic Single Error Correcting and All Unidirectional Error Detecting (SEC-AUED) Codes.- Coding Sequences with Constraints.- Robust Error Control Sequences for Efficient Software Implementation.- Author Index.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.