Constructions of Binary Codes Based on Bipartite Graphs

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.

Saved in:
Bibliographic Details
Published inMathematics in computer science Vol. 10; no. 2; pp. 223 - 227
Main Author Wong, Denis C. K.
Format Journal Article
LanguageEnglish
Published Cham Springer International Publishing 01.06.2016
Subjects
Computer Science
Mathematics
Mathematics and Statistics
Linear codes
Minimum distance
Secondary 57M15
Primary 14G50
Bipartite graphs
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1661-8270
1661-8289
DOI:10.1007/s11786-016-0258-0