Basic Concepts in Information Theory and Coding is an outgrowth of a one semester introductory course that has been taught at the University of Southern California since the mid-1960s. Lecture notes from that course have evolved in response to student reaction, new technological and theoretical develop ments, and the insights of faculty members who have taught the course (in cluding the three of us). In presenting this material, we have made it accessible to a broad audience by limiting prerequisites to basic calculus and the ele mentary concepts of discrete probability theory. To keep the material suitable for a one-semester course, we have limited its scope to discrete information theory and a general discussion of coding theory without detailed treatment of algorithms for encoding and decoding for various specific code classes. Readers will find that this book offers an unusually thorough treatment of noiseless self-synchronizing codes, as well as the advantage of problem sections that have been honed by reactions and interactions of several gen erations of bright students, while Agent 00111 provides a context for the discussion of abstract concepts."

This volume contains the refereed proceedings papers of the Fifth International ConferenceonSequencesandtheirApplications(SETA2008), heldinLexington, Kentucky (USA), September 14-18, 2008. The conference SETA is well est- lished in the mathematics and computer science community. Topics of "SETA" include - Randomness of sequences - Correlation (periodic and aperiodic types) and combinatorial aspects of - quences (di?erence sets) - Sequences with applications in coding theory and cryptography - Sequences over ?nite ?elds/rings/function ?elds - Linear and nonlinear feedback shift register sequences - Sequences for radar distance ranging, synchronization, identi?cation, and hardware testing - Sequences for wireless communication - Pseudorandom sequence generators - Correlation and transformation of Boolean functions - Multidimensional sequences and their correlation properties - Linear and nonlinear complexity of sequences. This year's proceedings contain 32 contributed papers. All papers have been thoroughly refereed by at least two referees. Most of the refereeing was done by members of the program committee. We thank all of them for their help. We arealsogratefultoSerdarBozta, s, Nina Brandst] atter, Nicolas Courtois, Fa- wei Fu, Honggang Hu, Alexander Kholosha, Emmanuel Prou?, Martin Ro ]tteler, Ayineedi Venkateswarlu and Bo-Yin Yang for their assistance in the reviewing process. In addition to the contributed papers, we had four invited lectures given by Claude Carlet (University of Paris 8, France), Pierre L'Ecuyer (Universitede Montr eal, Canada), Guang Gong (University of Waterloo, Canada) and Robert McEliece (California Institute of Technology, USA). You ?nd papers based on these invited talks in this volume."

This book constitutes the thoroughly refereed post-proceedings of the International Workshop of Sequences, Subsequences and Consequences, SSC 2007, held in Los Angeles, CA, USA, in May/June 2007.

The 16 revised invited full papers and 1 revised contributed paper presented together with 3 keynote lectures were carefully reviewed and selected for presentation in the book. The theory of sequences from discrete symbol alphabets has found practical applications in many areas of coded communications and in cryptography, including: 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-correcting codes. The workshop permits leading researchers on sequences from around the world to present their latest results and recent developments in this important field.

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.

This book provides a comprehensive 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.

Basic Concepts in Information Theory and Coding is an outgrowth of a one semester introductory course that has been taught at the University of Southern California since the mid-1960s. Lecture notes from that course have evolved in response to student reaction, new technological and theoretical develop ments, and the insights of faculty members who have taught the course (in cluding the three of us). In presenting this material, we have made it accessible to a broad audience by limiting prerequisites to basic calculus and the ele mentary concepts of discrete probability theory. To keep the material suitable for a one-semester course, we have limited its scope to discrete information theory and a general discussion of coding theory without detailed treatment of algorithms for encoding and decoding for various specific code classes. Readers will find that this book offers an unusually thorough treatment of noiseless self-synchronizing codes, as well as the advantage of problem sections that have been honed by reactions and interactions of several gen erations of bright students, while Agent 00111 provides a context for the discussion of abstract concepts."

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.