An intrinsical description of group codes

A (left) group code of length n is a linear code which is the image of a (left) ideal of a group algebra via an isomorphism which maps G to the standard basis of . Many classical linear codes have been shown to be group codes. In this paper we obtain a criterion to decide when a linear code is a gro...

Full description

Saved in:
Bibliographic Details
Published in:Designs, codes, and cryptography codes, and cryptography, 2009-06, Vol.51 (3), p.289-300
Main Authors: Bernal, José Joaquín, del Río, Ángel, Simón, Juan Jacobo
Format: Article
Language:English
Subjects:
Circuits
Coding and Information Theory
Computer Science
Cryptology
Data Structures and Information Theory
Discrete Mathematics in Computer Science
Information and Communication
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A (left) group code of length n is a linear code which is the image of a (left) ideal of a group algebra via an isomorphism which maps G to the standard basis of . Many classical linear codes have been shown to be group codes. In this paper we obtain a criterion to decide when a linear code is a group code in terms of its intrinsical properties in the ambient space , which does not assume an “a priori” group algebra structure on . As an application we provide a family of groups (including metacyclic groups) for which every two-sided group code is an abelian group code. It is well known that Reed–Solomon codes are cyclic and its parity check extensions are elementary abelian group codes. These two classes of codes are included in the class of Cauchy codes. Using our criterion we classify the Cauchy codes of some lengths which are left group codes and the possible group code structures on these codes.
ISSN:0925-1022
1573-7586
DOI:10.1007/s10623-008-9261-z