Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Coding and Quantization
 
Edited by: Robert Calderbank
G. David Forney, Jr.
Nader Moayeri
A co-publication of the AMS and DIMACS
Coding and Quantization
Hardcover ISBN:  978-0-8218-6603-0
Product Code:  DIMACS/14
List Price: $100.00
MAA Member Price: $90.00
AMS Member Price: $80.00
eBook ISBN:  978-1-4704-3972-9
Product Code:  DIMACS/14.E
List Price: $94.00
MAA Member Price: $84.60
AMS Member Price: $75.20
Hardcover ISBN:  978-0-8218-6603-0
eBook: ISBN:  978-1-4704-3972-9
Product Code:  DIMACS/14.B
List Price: $194.00 $147.00
MAA Member Price: $174.60 $132.30
AMS Member Price: $155.20 $117.60
Add to cart
Coding and Quantization
Click above image for expanded view
Coding and Quantization
Edited by: Robert Calderbank
G. David Forney, Jr.
Nader Moayeri
A co-publication of the AMS and DIMACS
Hardcover ISBN:  978-0-8218-6603-0
Product Code:  DIMACS/14
List Price: $100.00
MAA Member Price: $90.00
AMS Member Price: $80.00
eBook ISBN:  978-1-4704-3972-9
Product Code:  DIMACS/14.E
List Price: $94.00
MAA Member Price: $84.60
AMS Member Price: $75.20
Hardcover ISBN:  978-0-8218-6603-0
eBook ISBN:  978-1-4704-3972-9
Product Code:  DIMACS/14.B
List Price: $194.00 $147.00
MAA Member Price: $174.60 $132.30
AMS Member Price: $155.20 $117.60
Add to cart
  • Book Details
     
     
    DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
    Volume: 14; 1993; 263 pp
    MSC: Primary 94

    This volume contains the proceedings of the DIMACS/IEEE workshop on coding and quantization. The theme of the workshop was the application of discrete mathematics to reliable data transmission and source compression. These applications will become more significant in the coming years, with the advent of high-capacity cellular networks, personal communications devices, and the “wireless office”. The articles are written by experts from industry and from academia. Requiring only a background in basic undergraduate mathematics, this book appeals to mathematicians interested in multidimensional Euclidean geometry (especially lattice theory), as well as to engineers interested in bandwidth efficient communication or vector quantization.

    Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).
    Readership

    Mathematicians interested in multidimensional Euclidean geometry. Engineers interested in bandwidth efficient communication or vector quantization.
  • Table of Contents
     
     
    • Chapters
    • On the duality of coding and quantizing
    • On existence proofs for asymptotically good Euclidean-space group codes
    • The Nordstrom-Robinson code is the binary image of the octacode
    • Generalized theta functions for lattice vector quantization
    • Tree structured signal space codes
    • The other asymptotic theory of Lossy source coding
    • Block-constrained quantization: asymptotic analysis
    • Syndrome-based VQ codebooks
    • Decoding under integer metric constraints
    • The optimality of the natural binary code
    • Multiple description Scalar quantizer design: good index assignments
    • Structured vector quantizers as generalized product codes
    • A new construction of trellis-coded quantizers
    • Trellis-based Scalar-vector quantizer for memoryless sources
    • Lattice-structured codebooks–construction and implementation for memoryless sources
    • Decoding on a finite state transition diagram while avoiding a sub-diagram
    • Covering properties of binary convolutional codes and lattice quantization of uniform sources
    • A Markovian method common to both quantization and decoding using convolutional codes
    • Trellis codes, symbolic dynamics, and isometries
    • The design of finite-state machines for quantization using simulated annealing
    • The M-algorithm, the failure of reduced-state sequence detection with good convolutional codes, and some implications for trellis coding
    • An algebraic approach to constructing convolutional codes from quasi-cyclic codes
    • Table-driven decoding of convolutional codes with soft decision
    • Rotationally invariant multilevel codes
    • Constellations for diversity
    • Bounded expansion codes for error control
    • A bound on the zero-error list coding capacity
    • Geometric vector quantization for subband-based video coding
    • Recursively indexed differential pulse code modulation
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Accessibility – to request an alternate format of an AMS title
DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
Volume: 14; 1993; 263 pp
MSC: Primary 94

This volume contains the proceedings of the DIMACS/IEEE workshop on coding and quantization. The theme of the workshop was the application of discrete mathematics to reliable data transmission and source compression. These applications will become more significant in the coming years, with the advent of high-capacity cellular networks, personal communications devices, and the “wireless office”. The articles are written by experts from industry and from academia. Requiring only a background in basic undergraduate mathematics, this book appeals to mathematicians interested in multidimensional Euclidean geometry (especially lattice theory), as well as to engineers interested in bandwidth efficient communication or vector quantization.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).
Readership

Mathematicians interested in multidimensional Euclidean geometry. Engineers interested in bandwidth efficient communication or vector quantization.
  • Chapters
  • On the duality of coding and quantizing
  • On existence proofs for asymptotically good Euclidean-space group codes
  • The Nordstrom-Robinson code is the binary image of the octacode
  • Generalized theta functions for lattice vector quantization
  • Tree structured signal space codes
  • The other asymptotic theory of Lossy source coding
  • Block-constrained quantization: asymptotic analysis
  • Syndrome-based VQ codebooks
  • Decoding under integer metric constraints
  • The optimality of the natural binary code
  • Multiple description Scalar quantizer design: good index assignments
  • Structured vector quantizers as generalized product codes
  • A new construction of trellis-coded quantizers
  • Trellis-based Scalar-vector quantizer for memoryless sources
  • Lattice-structured codebooks–construction and implementation for memoryless sources
  • Decoding on a finite state transition diagram while avoiding a sub-diagram
  • Covering properties of binary convolutional codes and lattice quantization of uniform sources
  • A Markovian method common to both quantization and decoding using convolutional codes
  • Trellis codes, symbolic dynamics, and isometries
  • The design of finite-state machines for quantization using simulated annealing
  • The M-algorithm, the failure of reduced-state sequence detection with good convolutional codes, and some implications for trellis coding
  • An algebraic approach to constructing convolutional codes from quasi-cyclic codes
  • Table-driven decoding of convolutional codes with soft decision
  • Rotationally invariant multilevel codes
  • Constellations for diversity
  • Bounded expansion codes for error control
  • A bound on the zero-error list coding capacity
  • Geometric vector quantization for subband-based video coding
  • Recursively indexed differential pulse code modulation
Review Copy – for publishers of book reviews
Accessibility – to request an alternate format of an AMS title
Powered by MathJax
Please select which format for which you are requesting permissions.