8 research outputs found
Binary Cyclic Codes from Explicit Polynomials over \gf(2^m)
Cyclic codes are a subclass of linear codes and have applications in consumer
electronics, data storage systems, and communication systems as they have
efficient encoding and decoding algorithms. In this paper, monomials and
trinomials over finite fields with even characteristic are employed to
construct a number of families of binary cyclic codes. Lower bounds on the
minimum weight of some families of the cyclic codes are developed. The minimum
weights of other families of the codes constructed in this paper are
determined. The dimensions of the codes are flexible. Some of the codes
presented in this paper are optimal or almost optimal in the sense that they
meet some bounds on linear codes. Open problems regarding binary cyclic codes
from monomials and trinomials are also presented.Comment: arXiv admin note: substantial text overlap with arXiv:1206.4687,
arXiv:1206.437
Codes and Pseudo-Geometric Designs from the Ternary -Sequences with Welch-type decimation
Pseudo-geometric designs are combinatorial designs which share the same
parameters as a finite geometry design, but which are not isomorphic to that
design. As far as we know, many pseudo-geometric designs have been constructed
by the methods of finite geometries and combinatorics. However, none of
pseudo-geometric designs with the parameters is constructed by the approach of coding theory. In
this paper, we use cyclic codes to construct pseudo-geometric designs. We
firstly present a family of ternary cyclic codes from the -sequences with
Welch-type decimation , and obtain some infinite family
of 2-designs and a family of Steiner systems
using these cyclic codes and their duals. Moreover, the parameters of these
cyclic codes and their shortened codes are also determined. Some of those
ternary codes are optimal or almost optimal. Finally, we show that one of these
obtained Steiner systems is inequivalent to the point-line design of the
projective space and thus is a pseudo-geometric design.Comment: 15 pages. arXiv admin note: text overlap with arXiv:2206.15153,
arXiv:2110.0388
Cyclic Codes from Dickson Polynomials
Due to their efficient encoding and decoding algorithms cyclic codes, a
subclass of linear codes, have applications in consumer electronics, data
storage systems, and communication systems. In this paper, Dickson polynomials
of the first and second kind over finite fields are employed to construct a
number of classes of cyclic codes. Lower bounds on the minimum weight of some
classes of the cyclic codes are developed. The minimum weights of some other
classes of the codes constructed in this paper are determined. The dimensions
of the codes obtained in this paper are flexible. Most of the codes presented
in this paper are optimal or almost optimal in the sense that they meet some
bound on linear codes. Over ninety cyclic codes of this paper should be used to
update the current database of tables of best linear codes known. Among them
sixty are optimal in the sense that they meet some bound on linear codes and
the rest are cyclic codes having the same parameters as the best linear code in
the current database maintained at http://www.codetables.de/
Cyclic Codes From the Two-Prime Sequences
Cyclic codes are a subclass of linear codes and have wide applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, the two-prime sequence is employed to construct several classes of cyclic codes over GF(q). Lower bounds on the minimum weight of these cyclic codes are developed. Some of the codes obtained are optimal or almost optimal. The p-ranks of the twin-prime difference sets and a class of almost difference sets are computed