2018
DOI: 10.1016/j.disc.2018.03.008
|View full text |Cite
|
Sign up to set email alerts
|

Contraction of cyclic codes over finite chain rings

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(6 citation statements)
references
References 11 publications
0
6
0
Order By: Relevance
“…In [6], the authors introduced and studied the Galois closure of a linear code C over R of length n as follows,…”
Section: Codes Over Chain Ringsmentioning
confidence: 99%
See 3 more Smart Citations
“…In [6], the authors introduced and studied the Galois closure of a linear code C over R of length n as follows,…”
Section: Codes Over Chain Ringsmentioning
confidence: 99%
“…where d is a divisor of r. Recall that for any linear code C over R of length n, its subring subcode is given by Res d (C) = C ∩(S d ) n . In [6] it is shown that σ d -invariant, if and only if, T d (C) = Res d (C) if and only if, C = Ext(Res d (C)). For ∈ {0, 1, .…”
Section: Codes Over Chain Ringsmentioning
confidence: 99%
See 2 more Smart Citations
“…Cyclicity of codes weight of some polycyclic codes over Galois rings was established. Also in [4] some classes of constacyclic codes over finite chain rings were characterized via cyclotomic cosets as contraction of some cyclic codes. In [11], the authors studied the algebraic structure of a class of linear codes over finite chain rings containing the polycyclic codes.…”
Section: Introductionmentioning
confidence: 99%