Perfect Codes And Related Structures

In This Monograph, We Develop The Theory Of One Of The Most Fascinating Topics In Coding Theory, Namely, Perfect Codes And Related Structures. Perfect Codes Are Considered To Be The Most Beautiful Structure In Coding Theory, At Least From The Mathematical Side. These Codes Are The Largest Ones With Their Given Parameters. The Book Develops The Theory Of These Codes In Various Metrics - Hamming, Johnson, Lee, Grassmann, As Well As In Other Spaces And Metrics. It Also Cover Other Related Structures Such As Diameter Perfect Codes, Quasi-Perfect Codes, Mixed Codes, Tilings, Combinatorial Designs, And More. The Goal Is To Give The Aspects Of All These Codes, To Derive Bounds On Their Sizes, And Present Various Constructions For These Codes. The Intension Is To Offer A Different Perspective For The Area Of Perfect Codes. For Example, In Many Chapters There Is A Section Devoted To Diameter Perfect Codes. In These Codes, Anticodes Are Used Instead Of Balls And These Anticodes Are Related To Intersecting Families, An Area That Is Part Of Extremal Combinatorics. This Is One Example That Shows How We Direct Our Exposition In This Book To Both Researchers In Coding Theory And Mathematicians Interested In Combinatorics And Extremal Combinatorics. New Perspectives For Mds Codes, Different From The Classic Ones, Which Lead To New Directions Of Research On These Codes Are Another Example Of How This Book May Appeal To Both Researchers In Coding Theory And Mathematicians. The Book Can Also Be Used As A Textbook, Either On Basic Course In Combinatorial Coding Theory, Or As An Advance Course In Combinatorial Coding Theory.