In this paper, we construct some families of binary linear and nonlinear codes by using various bipartite graphs. Furthermore, we also determine some conditions for the constructed binary linear code to be a maximum distance separable code.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Asratian, A.S., Denley, M.J.T., Hggkvist, R.: Bipartite graphs and their applications. In: Cambridge Tracts in Mathematics, vol. 131. Cambridge University Press, Cambridge (1998)
Gross, J.L., Yellen, J.: Graph theory and its applications. In: Discrete Mathematics and its Applications, 2nd edn. CRC Press, Boca Raton (2005)
Moon, K.T.: Error Correction Coding: Mathematical Methods and Algorithms. Wiley, New York (2005)
Sloane, N.J.A., Macwilliam, F.J.: The Theory of Error Correcting Codes. North-Holland, Amsterdam (1978)
Wilson, R.J.: Introduction to Graph Theory. Longman, Hong Kong (1972)
This work was completed with the support of UTAR funding.
About this article
Cite this article
Wong, D.C.K. Constructions of Binary Codes Based on Bipartite Graphs . Math.Comput.Sci. 10, 223–227 (2016). https://doi.org/10.1007/s11786-016-0258-0
- Linear codes
- Bipartite graphs
- Minimum distance
Mathematics Subject Classification
- Primary 14G50
- Secondary 57M15