2019
DOI: 10.48550/arxiv.1902.03516
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Skew-Polynomial Rings and Skew-Cyclic Codes

Heide Gluesing-Luerssen

Abstract: This is a survey on the theory of skew-cyclic codes based on skew-polynomial rings of automorphism type. Skew-polynomial rings have been introduced and discussed by Ore (1933). Evaluation of skew polynomials and sets of (right) roots were first considered by Lam (1986) and studied in great detail by Lam and Leroy thereafter. After a detailed presentation of the most relevant properties of skew polynomials, we survey the algebraic theory of skew-cyclic codes as introduced by Boucher and Ulmer ( 2007) and studie… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 25 publications
0
3
0
Order By: Relevance
“…In this section we recall some basic notions on skew polynomial rings and skew cyclic codes. The interested reader is referred to the recent survey of Gluesing-Luerssen [21].…”
Section: Skew Cyclic Codes and Skew Reed-solomon Codesmentioning
confidence: 99%
“…In this section we recall some basic notions on skew polynomial rings and skew cyclic codes. The interested reader is referred to the recent survey of Gluesing-Luerssen [21].…”
Section: Skew Cyclic Codes and Skew Reed-solomon Codesmentioning
confidence: 99%
“…The novelty of the paper is concentrated in the third section, more exactly, the new results are Definition 3.3 (inspired in the notion of algebraic set given in Section 5 of [7]), Theorem 3.4, Corollary 3.5, Lemma 3.11 and Theorem 3.12 (main theorem). Some examples that illustrate the main theorem are presented in Example 3.…”
Section: Introductionmentioning
confidence: 99%
“…(iii) The previous example can be generalized in the following way (see [5], Lemma 4.1, or also [32], Proposition 3.3.15): Let q ∈ F − {0} and A := F q [x 1 , . .…”
mentioning
confidence: 99%