Hardcover ISBN:  9780821866030 
Product Code:  DIMACS/14 
List Price:  $100.00 
MAA Member Price:  $90.00 
AMS Member Price:  $80.00 
eBook ISBN:  9781470439729 
Product Code:  DIMACS/14.E 
List Price:  $94.00 
MAA Member Price:  $84.60 
AMS Member Price:  $75.20 
Hardcover ISBN:  9780821866030 
eBook: ISBN:  9781470439729 
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 
Hardcover ISBN:  9780821866030 
Product Code:  DIMACS/14 
List Price:  $100.00 
MAA Member Price:  $90.00 
AMS Member Price:  $80.00 
eBook ISBN:  9781470439729 
Product Code:  DIMACS/14.E 
List Price:  $94.00 
MAA Member Price:  $84.60 
AMS Member Price:  $75.20 
Hardcover ISBN:  9780821866030 
eBook ISBN:  9781470439729 
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 

Book DetailsDIMACS  Series in Discrete Mathematics and Theoretical Computer ScienceVolume: 14; 1993; 263 ppMSC: 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 highcapacity 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.
Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were copublished with the Association for Computer Machinery (ACM).
ReadershipMathematicians 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 Euclideanspace group codes

The NordstromRobinson 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

Blockconstrained quantization: asymptotic analysis

Syndromebased 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 trelliscoded quantizers

Trellisbased Scalarvector quantizer for memoryless sources

Latticestructured codebooks–construction and implementation for memoryless sources

Decoding on a finite state transition diagram while avoiding a subdiagram

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 finitestate machines for quantization using simulated annealing

The Malgorithm, the failure of reducedstate sequence detection with good convolutional codes, and some implications for trellis coding

An algebraic approach to constructing convolutional codes from quasicyclic codes

Tabledriven decoding of convolutional codes with soft decision

Rotationally invariant multilevel codes

Constellations for diversity

Bounded expansion codes for error control

A bound on the zeroerror list coding capacity

Geometric vector quantization for subbandbased video coding

Recursively indexed differential pulse code modulation


RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Requests
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 highcapacity 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.
Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were copublished with the Association for Computer Machinery (ACM).
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 Euclideanspace group codes

The NordstromRobinson 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

Blockconstrained quantization: asymptotic analysis

Syndromebased 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 trelliscoded quantizers

Trellisbased Scalarvector quantizer for memoryless sources

Latticestructured codebooks–construction and implementation for memoryless sources

Decoding on a finite state transition diagram while avoiding a subdiagram

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 finitestate machines for quantization using simulated annealing

The Malgorithm, the failure of reducedstate sequence detection with good convolutional codes, and some implications for trellis coding

An algebraic approach to constructing convolutional codes from quasicyclic codes

Tabledriven decoding of convolutional codes with soft decision

Rotationally invariant multilevel codes

Constellations for diversity

Bounded expansion codes for error control

A bound on the zeroerror list coding capacity

Geometric vector quantization for subbandbased video coding

Recursively indexed differential pulse code modulation