Having trouble deciding which coding scheme to employ, how to design a new scheme, or how to improve an existing system? This summary of the state-of-the-art in iterative coding makes this decision more straightforward. With emphasis on the underlying theory, techniques to analyse and design practical iterative coding systems are presented. Using Gallager's original ensemble of LDPC codes, the basic concepts are extended for several general codes, including the practically important class of turbo codes. The simplicity of the binary erasure channel is exploited to develop analytical techniques and intuition, which are then applied to general channel models. A chapter on factor graphs helps to unify the important topics of information theory, coding and communication theory. Covering the most recent advances, this text is ideal for graduate students in electrical engineering and computer science, and practitioners. Additional resources, including instructor's solutions and figures, available online: www.cambridge.org/9780521852296.

This book constitutes the refereed proceedings of the 10th International Conference on Cryptology and Network Security, CANS 2011, held in Sanya, China, in December 2011. The 18 revised full papers, presented were carefully reviewed and selected from 65 submissions. The book also includes two invited talks. The papers are organized in topical sections on symmetric cryptanalysis, symmetric ciphers, public key cryptography, protocol attacks, and privacy techniques.

This book constitutes the refereed proceedings of the 13th IMA International Conference on Cryptography and Coding, IMACC 2011, held in Oxford, UK in December 2011. The 27 revised full papers presented together with one invited contribution were carefully reviewed and selected from 57 submissions. The papers cover a wide range of topics in the field of mathematics and computer science, including coding theory, homomorphic encryption, symmetric and public key cryptosystems, cryptographic functions and protocols, efficient pairing and scalar multiplication implementation, knowledge proof, and security analysis.

Link reversal is a versatile algorithm design technique that has been used in numerous distributed algorithms for a variety of problems. The common thread in these algorithms is that the distributed system is viewed as a graph, with vertices representing the computing nodes and edges representing some other feature of the system (for instance, point-to-point communication channels or a conflict relationship). Each algorithm assigns a virtual direction to the edges of the graph, producing a directed version of the original graph. As the algorithm proceeds, the virtual directions of some of the links in the graph change in order to accomplish some algorithm-specific goal. The criterion for changing link directions is based on information that is local to a node (such as the node having no outgoing links) and thus this approach scales well, a feature that is desirable for distributed algorithms. This monograph presents, in a tutorial way, a representative sampling of the work on link-reversal-based distributed algorithms. The algorithms considered solve routing, leader election, mutual exclusion, distributed queueing, scheduling, and resource allocation. The algorithms can be roughly divided into two types, those that assume a more abstract graph model of the networks, and those that take into account more realistic details of the system. In particular, these more realistic details include the communication between nodes, which may be through asynchronous message passing, and possible changes in the graph, for instance, due to movement of the nodes. We have not attempted to provide a comprehensive survey of all the literature on these topics. Instead, we have focused in depth on a smaller number of fundamental papers, whose common thread is that link reversal provides a way for nodes in the system to observe their local neighborhoods, take only local actions, and yet cause global problems to be solved. We conjecture that future interesting uses of link reversal are yet to be discovered. Table of Contents: Introduction / Routing in a Graph: Correctness / Routing in a Graph: Complexity / Routing and Leader Election in a Distributed System / Mutual Exclusion in a Distributed System / Distributed Queueing / Scheduling in a Graph / Resource Allocation in a Distributed System / Conclusion

The objective of the present edition of this monograph is the same as that of earlier editions, namely, to provide readers with some mathemati cal maturity a rigorous and modern introduction to the ideas and principal theorems of probabilistic information theory. It is not necessary that readers have any prior knowledge whatever of information theory. The rapid development of the subject has had the consequence that any one book can now cover only a fraction of the literature. The latter is often written by engineers for engineers, and the mathematical reader may have some difficulty with it. The mathematician who understands the content and methods of this monograph should be able to read the literature and start on research of his own in a subject of mathematical beauty and interest. The present edition differs from the second in the following: Chapter 6 has been completely replaced by one on arbitrarily varying channels. Chapter 7 has been greatly enlarged. Chapter 8 on semi-continuous channels has been drastically shortened, and Chapter 11 on sequential decoding completely removed. The new Chapters 11-15 consist entirely of material which has been developed only in the last few years. The topics discussed are rate distortion, source coding, multiple access channels, and degraded broadcast channels. Even the specialist will find a new approach in the treatment of these subjects. Many of the proofs are new, more perspicuous, and considerably shorter than the original ones."

The spreading of digital technology has resulted in a dramatic increase in the demand for data compression (DC) methods. At the same time, the appearance of highly integrated elements has made more and more com plicated algorithms feasible. It is in the fields of speech and image trans mission and the transmission and storage of biological signals (e.g., ECG, Body Surface Mapping) where the demand for DC algorithms is greatest. There is, however, a substantial gap between the theory and the practice of DC: an essentially nonconstructive information theoretical attitude and the attractive mathematics of source coding theory are contrasted with a mixture of ad hoc engineering methods. The classical Shannonian infor mation theory is fundamentally different from the world of practical pro cedures. Theory places great emphasis on block-coding while practice is overwhelmingly dominated by theoretically intractable, mostly differential predictive coding (DPC), algorithms. A dialogue between theory and practice has been hindered by two pro foundly different conceptions of a data source: practice, mostly because of speech compression considerations, favors non stationary models, while the theory deals mostly with stationary ones."

This book is the outcome of the successful NATO Advanced Study Institute on Pattern Recognition Theory and Applications, held at St. Anne's College, Oxford, in April 1981., The aim of the meeting was to review the recent advances in the theory of pattern recognition and to assess its current and future practical potential. The theme of the Institute - the decision making aspects of pattern recognition with the emphasis on the novel hybrid approaches - and its scope - a high level tutorial coverage of pattern recognition methodologies counterpointed with contrib uted papers on advanced theoretical topics and applications - are faithfully reflected by the volume. The material is divided into five sections: 1. Methodology 2. Image Understanding and Interpretation 3. Medical Applications 4. Speech Processing and Other Applications 5. Panel Discussions. The first section covers a broad spectrum of pattern recognition methodologies, including geometric, statistical, fuzzy set, syntactic, graph-theoretic and hybrid approaches. Its cove,r age of hybrid methods places the volume in a unique position among existing books on pattern recognition. The second section provides an extensive treatment of the topical problem of image understanding from both the artificial intelligence and pattern recognition points of view. The two application sections demonstrate the usefulness of the novel methodologies in traditional pattern 'recognition application areas. They address the problems of hardware/software implementation and of algorithm robustness, flexibility and general reliability. The final section reports on a panel discussion held during the Institute.

DES, the Data Encryption Standard, is the best known and most widely used civilian cryptosystem. It was developed by IBM and adopted as a US national standard in the mid 1970s, and had resisted all attacks in the last 15 years. This book presents the first successful attack which can break the full 16 round DES faster than via exhaustive search. It describes in full detail, the novel technique of Differential Cryptanalysis, and demonstrates its applicability to a wide variety of cryptosystems and hash functions, including FEAL, Khafre, REDOC-II, LOKI, Lucifer, Snefru, N-Hash, and many modified versions of DES. The methodology used offers valuable insights to anyone interested in data security and cryptography, and points out the intricacies of developing, evaluating, testing, and implementing such schemes. This book was written by two of the fields leading researchers, and describes state-of-the-art research in a clear and completely contained manner.

Approach your problems from the right end It isn't that they can't see the solution. It is and begin with the answers. Then one day, that they can't see the problem. perhaps you will find the final question. G. K. Chesterton. The Scandal of Father 'The Hermit Clad in Crane Feathers' in R. Brown 'The point of a Pin'. van Gulik's The Chif1ese Maze Murders. Growing specialization and diversification have brought a host of monographs and textbooks on increasingly specialized topics. However, the "tree" of knowledge of mathematics and related fields does not grow only by putting forth new branches. It also happens, quite often in fact, that branches which were thought to be completely disparate are suddenly seen to be related. Further, the kind and level of sophistication of mathematics applied in various sciences has changed drastically in recent years: measure theory is used (non trivially) in regional and theoretical economics; algebraic geometry interacts with physics; the Minkowsky lemma, coding theory and the structure of water meet one another in packing and covering theory; quantum fields, crystal defects and mathematical programming profit from homotopy theory; Lie algebras are relevant to filtering; and prediction and electrical engineering can use Stein spaces. And in addition to this there are such new emerging subdisciplines as "experimental mathematics", "CFD", "completely integrable systems", "chaos, synergetics and large-scale order", which are almost impossible to fit into the existing classification schemes. They draw upon widely different sections of mathematics.

For four decades, information theory has been viewed almost exclusively as a theory based upon the Shannon measure of uncertainty and information, usually referred to as Shannon entropy. Since the publication of Shannon's seminal paper in 1948, the theory has grown extremely rapidly and has been applied with varied success in almost all areas of human endeavor. At this time, the Shannon information theory is a well established and developed body of knowledge. Among its most significant recent contributions have been the use of the complementary principles of minimum and maximum entropy in dealing with a variety of fundamental systems problems such as predic tive systems modelling, pattern recognition, image reconstruction, and the like. Since its inception in 1948, the Shannon theory has been viewed as a restricted information theory. It has often been argued that the theory is capable of dealing only with syntactic aspects of information, but not with its semantic and pragmatic aspects. This restriction was considered a v~rtue by some experts and a vice by others. More recently, however, various arguments have been made that the theory can be appropriately modified to account for semantic aspects of in formation as well. Some of the most convincing arguments in this regard are in cluded in Fred Dretske's Know/edge & Flow of Information (The M.LT. Press, Cambridge, Mass., 1981) and in this book by Guy lumarie.

What constitutes an identity, how do new technologies affect identity, how do we manage identities in a globally networked information society? The increasing div- sity of information and communication technologies and their equally wide range of usage in personal, professional and official capacities raise challenging questions of identity in a variety of contexts. The aim of the IFIP/FIDIS Summer Schools has been to encourage young a- demic and industry entrants to share their own ideas about privacy and identity m- agement and to build up collegial relationships with others. As such, the Summer Schools have been introducing participants to the social implications of information technology through the process of informed discussion. The 4th International Summer School took place in Brno, Czech Republic, during September 1-7, 2008. It was organized by IFIP (International Federation for Infor- tion Processing) working groups 9.2 (Social Accountability), 9.6/11.7 (IT Misuse and the Law) and 11.6 (Identity Management) in cooperation with the EU FP6 Network of Excellence FIDIS and Masaryk University in Brno. The focus of the event was on security and privacy issues in the Internet environment, and aspects of identity m- agement in relation to current and future technologies in a variety of contexts.

This book constitutes the refereed proceedings of the 12th International Conference on Cryptology in India, INDOCRYPT 2011, held in Chennai, India, in December 2011. The 22 revised full papers presented together with the abstracts of 3 invited talks and 3 tutorials were carefully reviewed and selected from 127 submissions. The papers are organized in topical sections on side-channel attacks, secret-key cryptography, hash functions, pairings, and protocols.

Terrestrial Trunked Radio (TETRA) has become the tool to design any type of public security systems, in particular due to the strongly increased security demands for mobile systems. In this book, the authors show how TETRA can be strongly improved and these improvements will most probably be part of future TETRA standards. The areas examined include channel assignment and multiple access techniques, video transmission, wireless LAN integration, and the establishment of multiple wireless mesh networks. Since the requirements for these networks is security, the authors show that innovative techniques such as those based on chaotic signals can be used in order to maximize security.

The book is a vital reference point for researchers with ambition to find the general solution for modern problems of public safety.

The genesis of this volume was the participation of the editors in an ACMlSIGIR (Association for Computing Machinery/Special Interest Group on Information Retrieval) workshop entitled "Beyond Word Relations" (Hetzler, 1997). This workshop examined a number of relationship types with significance for information retrieval beyond the conventional topic-matching relationship. From this shared participation came the idea for an edited volume on relationships, with chapters to be solicited from researchers and practitioners throughout the world. Ultimately, one volume became two volumes. The first volume, Relationships in the Organization of Knowledge (Bean & Green, 200 I), examines the role of relationships in knowledge organization theory and practice, with emphasis given to thesaural relationships and integration across systems, languages, cultures, and disciplines. This second volume examines relationships in a broader array of contexts. The two volumes should be seen as companions, each informing the other. As with the companion volume, we are especially grateful to the authors who willingly accepted challenges of space and time to produce chapters that summarize extensive bodies of research. The value of the volume clearly resides in the quality of the individual chapters. In naming this volume The Semantics of Relationships: An Interdisciplinary Perspective, we wanted to highlight the fact that relationships are not just empty connectives. Relationships constitute important conceptual units and make significant contributions to meaning.

This book contains the thoroughly refereed post-conferernce proceedings of the 13th Information Hiding Conference, IH 2011, held in Prague, Czech Republic, in May 2011. Included in this volume are 23 carefully reviewed papers that were selected out of 69 submissions. The contributions are organized in topical sections on: fingerprinting, anonymity and privacy, steganography and steganalysis, watermarking, digital rights management and digital forensics, and digital hiding in unusual context. Also included are the papers that were presented as part of the special session dedicated to the BOSS (Break Our Steganographic System) contest.

This work presents new and old constructions of nearrings. Links between properties of the multiplicative of nearrings (as regularity conditions and identities) and the structure of nearrings are studied. Primality and minimality properties of ideals are collected. Some types of simpler' nearrings are examined. Some nearrings of maps on a group are reviewed and linked with group-theoretical and geometrical questions.
Audience: Researchers working in nearring theory, group theory, semigroup theory, designs, and translation planes. Some of the material will be accessible to graduate students.

The means and ends of information theory and computational complexity have grown significantly closer over the past decade. Common analytic tools, such as combinatorial mathematics and information flow arguments, have been the cornerstone of VLSl complexity and cooperative computation. The basic assumption of limited computing resources is the premise for cryptography, where the distinction is made between available information and accessible information. Numerous other examples of common goals and tools between the two disciplines have shaped a new research category of 'information and complexity theory'. This volume is intended to expose to the research community some of the recent significant topics along this theme. The contributions selected here are all very basic, presently active, fairly well-established, and stimulating for substantial follow-ups. This is not an encyclopedia on the subject, it is concerned only with timely contributions of sufficient coherence and promise. The styles of the six chapters cover a wide spectrum from specific mathematical results to surveys of large areas. It is hoped that the technical content and theme of this volume will help establish this general research area. I would like to thank the authors of the chapters for contributing to this volume. I also would like to thank Ed Posner for his initiative to address this subject systematically, and Andy Fyfe and Ruth Erlanson for proofreading some of the chapters.

This volume represents the refereed proceedings of the "Sixth International Conference on Finite Fields and Applications (Fq6)" held in the city of Oaxaca, Mexico, between 22-26 May 200l. The conference was hosted by the Departmento do Matermiticas of the U niversidad Aut6noma Metropolitana- Iztapalapa, Nlexico. This event continued a series of biennial international conferences on Finite Fields and Applications, following earlier meetings at the University of Nevada at Las Vegas (USA) in August 1991 and August 1993, the University of Glasgow (Scotland) in July 1995, the University of Waterloo (Canada) in August 1997, and at the University of Augsburg (Ger- many) in August 1999. The Organizing Committee of Fq6 consisted of Dieter Jungnickel (University of Augsburg, Germany), Neal Koblitz (University of Washington, USA), Alfred }. lenezes (University of Waterloo, Canada), Gary Mullen (The Pennsylvania State University, USA), Harald Niederreiter (Na- tional University of Singapore, Singapore), Vera Pless (University of Illinois, USA), Carlos Renteria (lPN, Mexico). Henning Stichtenoth (Essen Univer- sity, Germany). and Horacia Tapia-Recillas, Chair (Universidad Aut6noma l'vIetropolitan-Iztapalapa. Mexico). The program of the conference consisted of four full days and one half day of sessions, with 7 invited plenary talks, close to 60 contributed talks, basic courses in finite fields. cryptography and coding theory and a series of lectures at local educational institutions. Finite fields have an inherently fascinating structure and they are im- portant tools in discrete mathematics.

This book constitutes the refereed proceedings of the 14th International Conference on Information Security, ISC 2011, held in Xi'an, China, in October 2011. The 25 revised full papers were carefully reviewed and selected from 95 submissions. The papers are organized in topical sections on attacks; protocols; public-key cryptosystems; network security; software security; system security; database security; privacy; digital signatures.

The creation of the text really began in 1976 with the author being involved with a group of researchers at Stanford University and the Naval Ocean Systems Center, San Diego. At that time, adaptive techniques were more laboratory (and mental) curiosities than the accepted and pervasive categories of signal processing that they have become. Over the lasl 10 years, adaptive filters have become standard components in telephony, data communications, and signal detection and tracking systems. Their use and consumer acceptance will undoubtedly only increase in the future. The mathematical principles underlying adaptive signal processing were initially fascinating and were my first experience in seeing applied mathematics work for a paycheck. Since that time, the application of even more advanced mathematical techniques have kept the area of adaptive signal processing as exciting as those initial days. The text seeks to be a bridge between the open literature in the professional journals, which is usually quite concentrated, concise, and advanced, and the graduate classroom and research environment where underlying principles are often more important.

This book constitutes the refereed proceedings of the 8th International Conference on Autonomic and Trusted Computing, ATC 2011, held in Banff, Canada, September 2011.
The 17 revised full papers presented together with 1 keynote speech were carefully reviewed and selected from numerous submissions. The papers address all current issues in autonomic architectures, models and systems, autonomic communications, trusted and secure computing, reliable, secure and trust applications.

This book constitutes the refereed proceedings of the 8th VLDB Workshop on Secure Data Management held in Seattle, WA, USA in September 2, 2011 as a satellite workshop of the VLDB 2011 Conference . The 10 revised full papers presented were carefully reviewed and selected from 19 submissions. The papers are organized in topical sections on privacy protection and quantification, security in cloud and sensor networks and secure data managment technologies.

This book covers the basic statistical and analytical techniques of computer intrusion detection. It is the first to present a data-centered approach to these problems. It begins with a description of the basics of TCP/IP, followed by chapters dealing with network traffic analysis, network monitoring for intrusion detection, host based intrusion detection, and computer viruses and other malicious code.

This book constitutes the refereed proceedings of the IFIP WG 8.4/8.9 International Cross Domain Conference and Workshop on Availability, Reliability and Security - Multidisciplinary Research and Practice for Business, Enterprise and Health Information Systems, ARGES 2011, held in Vienna, Austria, in August 2011.The 29 revised papers presented were carefully reviewed and selected for inclusion in the volume. The papers concentrate on the many aspects of availability, reliability and security for information systems as a discipline bridging the application fields and the well- defined computer science field. They are organized in three sections: multidisciplinary research and practice for business, enterprise and health information systems; massive information sharing and integration and electronic healthcare; and papers from the colocated International Workshop on Security and Cognitive Informatics for Homeland Defense.

This book constitutes the refereed proceedings of the 4th International Workshop on Multiple Access Communications, MACOM 2011, held in Trento, Italy, in September 2011. The 21 full papers presented were carefully reviewed and selected from more than 40 submissions. They are divided in topical sections on cognitive radio; MAC protocols; communications theory; special session on MAC protocols for WSNs; system analysis and scheduling; and queuing systems.