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.

Basic Concepts in Information Theory and Coding: The Adventures of Secret Agent 00111 (Applications of Communications Theory)

Computers & Technology

Scholtz, Robert A.

Golomb, Solomon W.

Peile, Robert E.

Computer Science

Springer

Wireless communications, advanced radar and sonar systems, and security systems for Internet transactions are contemporary examples of systems that employ digital signals to transmit information. This volume affords comprehensive, up-to-date treatment of the methodologies and application areas throughout the range of digital communication where individual signals, and sets of signals, with favorable correlation properties play a central role. Some application areas covered include Code Division Multiple Access (CDMA) signals such as those in use for cell-phone communication; digital systems for coded radar and sonar signals; and methods for secure authentication and stream cipher cryptology. The authors provide the necessary mathematical background to explain how the signals are generated and to show how the signals satisfy the appropriate correlation constraints.

Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar

Gong, Guang

Cambridge University Press

Shift register sequences are used in a broad range of applications, particularly in random number generation, multiple access and polling techniques, secure and privacy communication systems, error detecting and correcting codes, and synchronization pattern generation, as well as in modern cryptographic systems. The first edition of Shift Register Sequences, published in 1967, has been for many years the definitive work on this subject. In the revised edition, Dr. Golomb has added valuable supplemental material. The revised Edition contains a comprehensive bibliography of some 400 entries which cover the literature concerning the theory and applications of shift register sequences. Written in a clear and lucid style, Dr. Golomb's approach is completely mathematical with rigorous proofs of all assertions. The proofs, however, may be omitted without loss of continuity by the reader who is interested only in results. Dr. Golomb is considered one of the foremost experts in the world with respect to combinatorial and geometrical aspects of coded communications.

Shift Register Sequences

Science & Math

Mathematics

Aegean Park Pr

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.

Solomon Golomb’s Course on Undergraduate Combinatorics

Liu, Andy

See the best price to sell, buy, or rent books by Golomb, Solomon W.. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Golomb, Solomon W.