• A GRAPH THEORETIC APPROACH TO BOUNDS ON CODES
Abstract
The aim of this paper is to discuss the bounds on codes based on graph theoretic techniques. The well-known Singleton and Hamming bounds can be derived as an application of a property relating the clique and independence number of vertex transitive graphs.
Keywords
Hamming graph, Clique number, Independence number, Vertex transitive graph,
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |