Listing 1 - 10 of 24 | << page >> |
Sort by
|
Choose an application
These are the proceedings of the Workshop on Sequences, Subsequences, and Consequences that was held at the University of Southern California (USC), May 31 - June 2, 2007. There were three one-hour Keynote lectures, 16 invited talks of up to 45 minutes each, and 1 “contributed” paper. The theory of sequences from discrete symbol alphabets has found practical applications in many areas of coded communications and in cryptography, - cluding: signal patterns for use in radar and sonar; spectral spreading sequences for CDMA wireless telephony; key streams for direct sequence stream-cipher cryptography; and a variety of forward-error-correctingcodes. The workshopwasdesigned to bring leading researcherson “sequences”from aroundtheworldtopresenttheirlatestresults,interchangeinformationwithone another, and especially to inform the larger audience of interested participants, includingfaculty,researchers,scholars,andstudentsfromnumerousinstitutions, as well as the readers of these proceedings, about recent developments in this important ?eld. There were invited speakers from Canada, China, Germany, India, Israel, Norway, Puerto Rico, and South Korea, in addition to those from the USA. Support for the workshop was generously provided by the O?ce of the Dean of the Viterbi School of Engineering, by the Center for Communications Research (CCR-La Jolla), and by the United States National Science Foundation (NSF). This support is hereby gratefully acknowledged.
Coding theory --- Sequences (Mathematics) --- Sequential machine theory --- Data encryption (Computer science) --- Codage --- Suites (Mathématiques) --- Théorie des machines séquentielles --- Chiffrement (Informatique) --- Congresses. --- Congrès --- Algebra --- Mathematics --- Physical Sciences & Mathematics --- Computer science. --- Computer communication systems. --- Data encryption (Computer science). --- Coding theory. --- Computers. --- Computer science --- Computer Science. --- Theory of Computation. --- Coding and Information Theory. --- Data Encryption. --- Discrete Mathematics in Computer Science. --- Computer Communication Networks. --- Mathematics. --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Data compression (Telecommunication) --- Digital electronics --- Information theory --- Signal theory (Telecommunication) --- Computer programming --- Data encoding (Computer science) --- Encryption of data (Computer science) --- Computer security --- Cryptography --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Network computers --- Informatics --- Science --- Distributed processing --- Information theory. --- Computational complexity. --- Cryptology. --- Complexity, Computational --- Communication theory --- Communication --- Computer science—Mathematics. --- Finite automata --- Finite state machines (Machine theory) --- Electronic digital computers --- Mathematical sequences --- Numerical sequences
Choose an application
Mathematical recreations --- Puzzles --- Games --- Jeux mathématiques --- Jeux intellectuels --- Jeux
Choose an application
Telecommunication --- Electronic digital computers --- Astronautics --- Télécommunications --- Ordinateurs --- Communication systems
Choose an application
Choose an application
Choose an application
Choose an application
Inspiring popular video games like Tetris while contributing to the study of combinatorial geometry and tiling theory, polyominoes have continued to spark interest ever since their inventor, Solomon Golomb, introduced them to puzzle enthusiasts several decades ago. In this fully revised and expanded edition of his landmark book, the author takes a new generation of readers on a mathematical journey into the world of the deceptively simple polyomino. Golomb incorporates important, recent developments, and poses problems, inviting the reader to play with and develop an understanding of the extraordinary properties of polyominoes.
Polyominoes. --- Combinatorial designs and configurations --- Ashbacher, Charles. --- Bird, David. --- Burnside, William. --- Conway, John H. --- Dahlke, Karl A. --- Doig, Alison. --- Earnshaw, Spencer. --- Eden, Murray. --- Fletcher, John G. --- Fraenkel, Aviezri. --- Gale, David. --- Gordon, Basil. --- Harary, Frank. --- Haselgrove, Jenifer. --- Jones, Kathy. --- Looger, Loren. --- Lunnon, W. F. --- Manvel, Bennet. --- Moore, E. F. --- Orman, Hilarie. --- Pascal, Blaise. --- Patton, W. E. --- Reid, Michael. --- Rothschild, Bruce. --- Satterfield, Wade. --- Stewart, Ian. --- Taylor, Herbert. --- Vancil, Andrew. --- Verbakel, Jan. --- Wang, Hao. --- Weyl, Hermann. --- Yoshigahara, Nob.
Choose an application
This textbook offers an accessible introduction to combinatorics, infused with Solomon Golomb's insights and illustrative examples. Core concepts in combinatorics are presented with an engaging narrative that suits undergraduate study at any level. Featuring early coverage of the Principle of Inclusion-Exclusion and a unified treatment of permutations later on, the structure emphasizes the cohesive development of ideas. Combined with the conversational style, this approach is especially well suited to independent study. Falling naturally into three parts, the book begins with a flexible Chapter Zero that can be used to cover essential background topics, or as a standalone problem-solving course. The following three chapters cover core topics in combinatorics, such as combinations, generating functions, and permutations. The final three chapters present additional topics, such as Fibonacci numbers, finite groups, and combinatorial structures. Numerous illuminating examples are included throughout, along with exercises of all levels. Three appendices include additional exercises, examples, and solutions to a selection of problems. Solomon Golomb's Course on Undergraduate Combinatorics is ideal for introducing mathematics students to combinatorics at any stage in their program. There are no formal prerequisites, but readers will benefit from mathematical curiosity and a willingness to engage in the book's many entertaining challenges.
Choose an application
Choose an application
This book provides a comprehensive, up-to-date description of the methodologies and the application areas, throughout the range of digital communication, in which individual signals and sets of signals with favorable correlation properties play a central role. The necessary mathematical background is presented to explain how these signals are generated, and to show how they satisfy the appropriate correlation constraints. All the known methods to obtain balanced binary sequences with two-valued autocorrelation, many of them only recently discovered, are presented in depth. The authors treat important application areas including: Code Division Multiple Access (CDMA) signals, such as those already in widespread use for cell-phone communication, and planned for universal adoption in the various approaches to 'third-generation'(3G) cell-phone use; systems for coded radar and sonar signals; communication signals to minimize mutual interference ('cross-talk') in multi-user environments; and pseudo-random sequence generation for secure authentication and for stream cipher cryptology.
Signal theory (Telecommunication) --- Signal processing --- Digital techniques.
Listing 1 - 10 of 24 | << page >> |
Sort by
|