Applications of combinatorial mathematics
Author(s)
Bibliographic Information
Applications of combinatorial mathematics
(The Institute of Mathematics and its Applications conference series, new ser.,
Clarendon Press , Oxford University Press, c1997
Available at 22 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
"Based on the proceedings of a conference on the applications of combinatorial mathematics organized by the Institute of Mathematics and Its Applications and held at the University of Oxford in December 1994."
Description and Table of Contents
Description
In the last thirty years, combinatorial mathematics has found itself at the heart of many technological applications. The aims of the conference on which this book is based were to stimulate combinatorial mathematicians to pursue new lines of research of potential practical importance, and to uncover the breadth of applications of the subject. Topics covered include neural networks, cryptography, radio frequency assignment for mobile telecommunications, coding
theory, sequences for communications applications, interconnection networks, data types, knot theory, radar, parallel processing, network reliability, formal specification of programs and protocols, and combinatorial optimisation.
Table of Contents
- The Combinatorics of some Abstract Data Types
- Recent Results in the Theory or Program Flowgraphs
- Applications of Combinatorics to Security
- The Regular Coloration of Graphs
- The Use of Combinatorial Structures in Communication Signal Design
- A Constructive Algorithm for Neural Network Design with Application to Channel Equalization
- The Weight Distribution of K M Codes
- Densities of Perfect Linear Complexity Profile Binary Sequences
- When Constraints are Easy to Satisfy
- A Unified Approach to Problems in Radio Channel Assignment
- Interconnection Networks Based on Two-dimensional de Bruijn Graphs
- A Graph Theoretic Solution to the Interface Equation
- Uniformly Optimally Reliable Networks for Vertex Failures
- Multi-Function Coding and Modulation for Spread Spectrum and CDMA with Inherent Security
- Multi-Stage Scheduling Problems with Precedence Constraints
- Frequency Assignment for Cellular Radio Networks
by "Nielsen BookData"