2016
DOI: 10.1016/j.ffa.2016.06.003
|View full text |Cite
|
Sign up to set email alerts
|

Characterizations of some two-dimensional cyclic codes correspond to the ideals of F[x,y]/<xs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
32
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(32 citation statements)
references
References 4 publications
0
32
0
Order By: Relevance
“…Özen et al [10] have studied cyclic codes over R. In fact, they determined a generators of the cyclic codes over R. In [10], it was proved that if m is odd, then S is a principal ideal ring. Now, by using a method similar that used for two-dimensional cyclic codes over a field in [13], we obtain a generator polynomials for two-dimensional cyclic codes over R. Our generating set has an important role in determining generator polynomials two-dimensional QC codes over R.…”
Section: Generator Polynomialsmentioning
confidence: 99%
See 1 more Smart Citation
“…Özen et al [10] have studied cyclic codes over R. In fact, they determined a generators of the cyclic codes over R. In [10], it was proved that if m is odd, then S is a principal ideal ring. Now, by using a method similar that used for two-dimensional cyclic codes over a field in [13], we obtain a generator polynomials for two-dimensional cyclic codes over R. Our generating set has an important role in determining generator polynomials two-dimensional QC codes over R.…”
Section: Generator Polynomialsmentioning
confidence: 99%
“…After that the researchers have studied with different concepts in these codes. The reader can find some of such studies in the papers [11][12][13]. Moreover, Lalason et al [7] construct a basis of an s-dimensional cyclic code over a finite field.…”
Section: Introductionmentioning
confidence: 99%
“…In 2016, Sepasdar and Khashyarmanesh [19] obtained generator polynomials of two-dimensional cyclic codes of length s.2 k (s 1 = s, s 2 = 2 k ) over F p m iteratively, where p is an odd prime. The authors state in the concluding remarks of their paper [19] that their method does not work for arbitrary 2-D cyclic codes, not even when s 1 = 3, s 2 = 3.…”
Section: Introductionmentioning
confidence: 99%
“…In 2016, Sepasdar and Khashyarmanesh [19] obtained generator polynomials of two-dimensional cyclic codes of length s.2 k (s 1 = s, s 2 = 2 k ) over F p m iteratively, where p is an odd prime. The authors state in the concluding remarks of their paper [19] that their method does not work for arbitrary 2-D cyclic codes, not even when s 1 = 3, s 2 = 3. In 2017, Sepasdar [20](unpublished) gave a method for obtaining generator matrix of 2-D cyclic codes of arbitrary length s 1 s 2 , but this construction does not help much in yielding numerical examples.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation