New linear codes over 𝔽9


Let dg (n, k) be the maximum possible minimum Hamming distance of a linear [n, k] code over lFg• In this paper, twenty-four new linear codes over lFg are constructed which improve the table of dg(n, k) by Brouwer. Four of these codes meet the upper bound on dg (n, k) and so are optimal. A geometric interpretation of the small dimensional codes is also given… (More)


2 Figures and Tables

Cite this paper

@article{Bierbrauer2000NewLC, title={New linear codes over 𝔽9}, author={J{\"u}rgen Bierbrauer and T. Aaron Gulliver}, journal={Australasian J. Combinatorics}, year={2000}, volume={21}, pages={131-140} }