On Isodual Double Toeplitz Codes

Double Toeplitz(shortly DT)codes are introduced here as a generalization of double circulant codes.The authors show that such a code is isodual,hence formally self-dual(FSD).FSD codes form a far-reaching generalization of self-dual codes,the most important class of codes of rate one-half.Self-dual DT codes are characterized as double circulant or double negacirculant.Likewise,even binary DT codes are characterized as double circulant.Numerical examples obtained by exhaustive search show that the codes constructed have best-known minimum distance,up to one unit,amongst formally self-dual codes,and sometimes improve on the known values.For q=2,the authors find four improvements on the best-known values of the minimum distance of FSD codes.Over F4 an explicit construction of DT codes,based on quadratic residues in a prime field,performs equally well.The authors show that DT codes are asymptotically good over Fq.Specifically,the authors construct DT codes arbitrarily close to the asymptotic Varshamov-Gilbert bound for codes of rate one half.

Polyadic Cyclic Codes over a Non-Chain Ring

Let f(u) and g(v) be two polynomials of degree k and l respectively, not both linear which split into distinct linear factors over Fq. Let be a finite commutative non-chain ring. In this paper, we study polyadic codes and their extensions over the ring R. We give examples of some polyadic codes which are optimal with respect to Griesmer type bound for rings. A Gray map is defined from which preserves duality. The Gray images of polyadic codes and their extensions over the ring R lead to construction of self-dual, isodual, self-orthogonal and complementary dual (LCD) codes over Fq. Some examples are also given to illustrate this.