2017
DOI: 10.1007/s10623-017-0440-7
|View full text |Cite
|
Sign up to set email alerts
|

Group rings, G-codes and constructions of self-dual and formally self-dual codes

Abstract: We give constructions of self-dual and formally self-dual codes from group rings where the ring is a finite commutative Frobenius ring. We improve the existing construction given in [11] by showing that one of the conditions given in the theorem is unnecessary and moreover it restricts the number of self-dual codes obtained by the construction. We show that several of the standard constructions of self-dual codes are found within our general framework. We prove that our constructed codes correspond to ideals i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
88
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
9

Relationship

2
7

Authors

Journals

citations
Cited by 59 publications
(97 citation statements)
references
References 18 publications
3
88
0
Order By: Relevance
“…The following construction of a matrix was first given for codes over fields by Hurley in [21]. It was extended to Frobenius rings in [10]. Let R be a finite commutative Frobenius ring and let G = {g 1 , g 2 , .…”
Section: 2mentioning
confidence: 99%
“…The following construction of a matrix was first given for codes over fields by Hurley in [21]. It was extended to Frobenius rings in [10]. Let R be a finite commutative Frobenius ring and let G = {g 1 , g 2 , .…”
Section: 2mentioning
confidence: 99%
“…We now give a construction of a code from an element of the group ring. This construction was given for codes over rings in [8] and for codes over fields in [14]. It was used in [11] to construct self-dual codes.…”
Section: G-codes Over Zmentioning
confidence: 99%
“…It is proven in [8] that if I(C) is an ideal in Z 4 G then I(C ⊥ ) is an ideal in Z 4 G. The following gives an example where the kernel of a group code over Z 4 is a minimum for all groups G. Specifically, where K(C(v)) = C(2v).…”
Section: Rank and Kernelmentioning
confidence: 99%
“…A classical way to produce a code from a group ring is to use the matrix representation of elements in a group ring and using zero divisors ( [16], [17]). In [6], the idea was extended to any group G and G-codes were defined as codes that are ideals in the group ring RG where R is a finite Frobenius ring. Group rings have also been used in constructing extremal binary self-dual codes.…”
Section: Introductionmentioning
confidence: 99%