Some constructions of linearly optimal group codes

  • Couselo E
  • González S
  • Markov V
 et al. 
  • 2


    Mendeley users who have this article in their library.
  • 1


    Citations of this article.


We continue here the research on (quasi)group codes over (quasi)group rings. We give some constructions of [n, n - 3, 3]q-codes over Fqfor n = 2 q and n = 3 q. These codes are linearly optimal, i.e. have maximal dimension among linear codes having a given length and distance. Although codes with such parameters are known, our main results state that we can construct such codes as (left) group codes. In the paper we use a construction of Reed-Solomon codes as ideals of the group ring FqG where G is an elementary abelian group of order q. © 2010 Elsevier Inc. All rights reserved.

Author-supplied keywords

  • Group code
  • Group ring
  • Linearly optimal code
  • Reed-Solomon code

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free