CYCLIC CODES OF LENGTH 2p(n) OVER FINITE CHAIN RINGS

Silva, Anderson; Milies, C. Polcino

Advanced search

Search - Use quotation marks to get a more specific result

Index

Field of knowledge

Start date

Betweenand

(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

CYCLIC CODES OF LENGTH 2p(n) OVER FINITE CHAIN RINGS

Full text
Author(s):	Silva, Anderson ^[1] ; Milies, C. Polcino ^[2] Total Authors: 2
Affiliation:	^[1] Univ Fed Vicosa, Dept Matemat, BR-36570000 Vicosa, MG - Brazil ^[2] Univ Sao Paulo, Inst Matemat & Estat, BR-05311970 Sao Paulo, SP - Brazil Total Affiliations: 2
Document type:	Journal article
Source:	Advances in Mathematics of Communications; v. 14, n. 2, p. 233-245, MAY 2020.
Web of Science Citations:	0
Abstract
We use group algebra methods to study cyclic codes over finite chain rings and under some restrictive hypotheses, described in section 2, for codes of length 2p(n), p a prime, we are able to compute the minimum weights of all possible cyclic codes of that length. (AU)

FAPESP's process:	15/09162-9 - Non commutative algebra and applications
Grantee:	Francisco Cesar Polcino Milies
Support Opportunities:	Research Projects - Thematic Grants

Short URL