Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Poset codes : partial orders, metrics and coding theory
Firer M., Alves M., Pinheiro J., Panek L., Springer International Publishing, New York, NY, 2018. 140 pp. Type: Book (978-3-319938-20-2)
Date Reviewed: Oct 30 2019

The idea of distance between vectors has found many nice applications in both mathematics and engineering. Coding theory (the art of reliable data storage) is fortunate enough to have many distances at hand, such as Hamming, Lee, Euclidean, and so on, which are quite useful for practical and theoretical purposes. In 1995, Brualdi et al. introduced a new poset metric, “determined by a partial order over a finite set, a poset” [1]. This generalizes the Hamming metric and the Niederreiter-Rosenbloom-Tsfasman (NRT) metric. In this book, Firer et al. study the basic questions of coding theory (in light of the classical Hamming metric) with respect to the new poset metric.

Chapter 1 reviews the basic concepts of coding theory (such as duality, syndrome decoding, generalized weight, and certain metric invariants such as packing and covering radius). Chapter 2 continues with partially ordered sets and presents two families of posets, hierarchical posets and multi-chain posets. Chapter 3 focuses on hierarchical posets and obtains results similar to the Hamming metric, such as packing radius, covering radius, perfect codes, and syndrome decoding. The NRT metric has a history of parallel development; one development “corresponds to the P-metric, where P is the union of r chains of length s.” Several coding-theoretic properties do not hold in the multi-chain case, for example, “the packing radius ... is not determined by the minimum distance” and “MacWilliams identities do not hold.”

Chapter 4 answers some of the related questions. Chapter 5 explores several duality theorems such as Wei’s results for generalized weights (using matroids) and MacWilliams-type identities (using group characters). Chapter 6 discusses “coding with general poset metrics, with no restrictions on the poset.” Finally, chapter 7 “present[s] different generalizations and variations of the poset metrics.”

This small but beautiful book presents many new research directions for coding theory students and researchers. Each chapter includes exercises, so it can also be used as a textbook for advanced undergraduate or graduate courses in mathematics and computer science.

Reviewer:  Manish Gupta Review #: CR146751 (2003-0046)
1) Brualdi, R. A.; Graves, J. S.; Lawrence, K. M. Codes with a poset metric. Discrete Mathematics 147, 1-3(1995), 57–72.
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
General (G.0 )
 
 
Hierarchical Design (D.4.7 ... )
 
 
Metrics (D.2.8 )
 
 
Coding And Information Theory (E.4 )
 
Would you recommend this review?
yes
no
Other reviews under "General": Date

Type: Journal
Feb 1 1986
Science, computers, and people: from the tree of mathematics
Ulam S., Birkhäuser Boston Inc., Cambridge, MA, 1986. Type: Book (9789780817632762)
May 1 1988
Computer science: a mathematical introduction
Lew A., Prentice-Hall, Inc., Upper Saddle River, NJ, 1985. Type: Book (9789780131642522)
Jul 1 1986
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy