The search functionality is under construction.

IEICE TRANSACTIONS on Fundamentals

An Algorithm for Augmenting a Binary Linear Code up to Gilbert Bound and New Codes Obtained by the Algorithm

Tadashi WADAYAMA, Hiroyuki KADOKAWA

  • Full Text Views

    0

  • Cite this

Summary :

An algorithm for augmenting a binary linear code is presented. The input to the code augmenting algorithm is (n,k,d) code C and the output is an (n,k*,d) augmented code C (k* k) satisfying C C and the Gilbert bound. The algorithm can be considered as an efficient implementation of the proof of Gilbert bound; for a given binary linear code C, the algorithm first finds a coset leader with the largest weight. If the weight of the coset leader is greater than or equal to the minimum distance of C, the coset leader is included to the basis of C.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.10 pp.2196-2202
Publication Date
2002/10/01
Publicized
Online ISSN
DOI
Type of Manuscript
Special Section PAPER (Special Section on Information Theory and Its Applications)
Category
Coding Theory

Authors

Keyword