On the construction of some optimal binary linear codes

Date of Publication

2015

Document Type

Master's Thesis

Degree Name

Master of Science in Mathematics

Subject Categories

Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Thesis Adviser

Ederlina G. Nocon

Abstract/Summary

Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C = [n k d] is called optimal if there is no linear code with higher minimum distance d given the length n and the dimension k. There are bounds giving limits for the minimum distance d of a linear code of xed length n and dimension k. The lower bound which can be taken by construction process tells that there is a known linear code having this minimum distance. The upper bound is given by theoretic results such as Griesmer bound [2]. One way to nd an optimal binary linear code is to make the lower bound of d equal to its higher bound. That is, to construct a binary linear code which achieves the highest possible value of its minimum distance d, given n and k. Some optimal binary linear codes were presented by Andries Brouwer [1] in his published table on bounds of the minimum distance d of binary linear codes for 1 n 256 and k n. This was further improved by Markus Grassl [3] by giving a detailed construction process for each code exhibiting the lower bound. In this paper, we construct new optimal binary linear codes by using some construction processes on existing binary linear codes. Particularly, we developed an algorithm applied to the codes already constructed to extend the list of optimal binary linear codes up to 257 n 300 for k 7.

Abstract Format

html

Language

English

Format

Electronic

Accession Number

CDTG006588

Shelf Location

Archives, The Learning Commons, 12F Henry Sy Sr. Hall

Physical Description

1 computer optical disc ; 4 3/4 in.

Keywords

Binary system (Mathematics)

Upload Full Text

wf_no

This document is currently not available here.

Share

COinS