Cyclic codes over finite rings

A.G. Shannon; Marcus Greferath

doi:10.1016/S0012-365X(97)00006-X

Cyclic codes over finite rings

A.G. Shannon, Marcus Greferath

Ei julkaistu Aalto-yliopiston affiliaatiolla

Tutkimustuotos: Lehtiartikkeli › Article › Scientific › vertaisarvioitu

30 Sitaatiot (Scopus)

Abstrakti

It is well known that cyclic linear codes of length n over a (finite) field F can be characterized in terms of the factors of the polynomial x n − 1 in F[ x]. This paper investigates cyclic linear codes over arbitrary (not necessarily commutative) finite rings and proves the above characterization to be true for a large class of such codes over these rings.

Alkuperäiskieli	Ei tiedossa
Sivut	273-277
Sivumäärä	5
Julkaisu	Discrete Mathematics
Vuosikerta	177
Numero	1-3
DOI - pysyväislinkit	https://doi.org/10.1016/S0012-365X(97)00006-X
Tila	Julkaistu - 1997
OKM-julkaisutyyppi	A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä

Pääsy asiakirjaan

10.1016/S0012-365X(97)00006-X

http://dx.doi.org/10.1016/S0012-365X(97)00006-X

Muut tiedostot ja linkit

Link to publication in Scopus

Siteeraa tätä

@article{b30c891027b54c4c92d0e5db8697074a,

title = "Cyclic codes over finite rings",

abstract = "It is well known that cyclic linear codes of length n over a (finite) field F can be characterized in terms of the factors of the polynomial x n − 1 in F[ x]. This paper investigates cyclic linear codes over arbitrary (not necessarily commutative) finite rings and proves the above characterization to be true for a large class of such codes over these rings. ",

author = "A.G. Shannon and Marcus Greferath",

year = "1997",

doi = "10.1016/S0012-365X(97)00006-X",

language = "Ei tiedossa",

volume = "177",

pages = "273--277",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - Cyclic codes over finite rings

AU - Shannon, A.G.

AU - Greferath, Marcus

PY - 1997

Y1 - 1997

N2 - It is well known that cyclic linear codes of length n over a (finite) field F can be characterized in terms of the factors of the polynomial x n − 1 in F[ x]. This paper investigates cyclic linear codes over arbitrary (not necessarily commutative) finite rings and proves the above characterization to be true for a large class of such codes over these rings.

AB - It is well known that cyclic linear codes of length n over a (finite) field F can be characterized in terms of the factors of the polynomial x n − 1 in F[ x]. This paper investigates cyclic linear codes over arbitrary (not necessarily commutative) finite rings and proves the above characterization to be true for a large class of such codes over these rings.

UR - https://www.scopus.com/pages/publications/0013202163

U2 - 10.1016/S0012-365X(97)00006-X

DO - 10.1016/S0012-365X(97)00006-X

M3 - Article

SN - 0012-365X

VL - 177

SP - 273

EP - 277

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -