# Cyclic code

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

- Finite Fields and Their Applications
- 2014

Cyclic codes are a subclass of linear codes and have applicat ions in consumer electronics, data storage systems, andâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- IEEE Transactions on Information Theory
- 2008

Let q=p<sup>m</sup> where p is an odd prime, mges2, and 1lesklesm-1. Let Tr be the trace mapping from F<sub>q</sub> to F<sub>pâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Finite Fields and Their Applications
- 2008

Let q = pm where p is an odd prime, m 3, k 1 and gcd(k,m) = 1. Let Tr be the trace mapping from Fq to Fp and Î¶p = e 2Ï€i p . Inâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- Applicable Algebra in Engineering, Communicationâ€¦
- 2007

We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skewâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- IEEE Trans. Information Theory
- 2001

A new algebraic approach to quasi-cyclic codes is introduced. The key idea is to regard a quasi-cyclic code over a field as aâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- IEEE Trans. Information Theory
- 1999

We introduce linear cyclic codes over the ring F 2 + uF 2 = f0; 1; u; u = u + 1g, where u 2 = 0. This ring shares many propertiesâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Des. Codes Cryptography
- 1995

This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo pa andâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- IEEE Trans. Information Theory
- 1994

Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructedâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- IEEE Trans. Information Theory
- 1992

A general theorem is proved showing how to ohtain a constant-weight binary cyclic code from a p-ary linear cyclic code, where pâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- IEEE Trans. Information Theory
- 1986

Ahstucrcf-The main result is a new lower bound for the min imum distance of cyclic codes that includes earlier bounds (i.e., BCHâ€¦Â (More)

Is this relevant?