The Existence and Application of Strongly Idempotent Self-orthogonal Row Latin Magic Arrays

Let N = {0, 1, ···, n-1}. A strongly idempotent self-orthogonal row Latin magic array of order n（SISORLMA（n） for short） based on N is an n × n array M satisfying the following properties：（1） each row of M is a permutation of N, and at least one column is not a permutation of N;（2） the sums of the n numbers in every row and every column are the same;（3） M is orthogonal to its transpose;（4） the main diagonal and the back diagonal of M are 0, 1, ···, n-1 from left to right. In this paper, it is proved that an SISORLMA（n）exists if and only if n ？ {2, 3}. As an application, it is proved that a nonelementary rational diagonally ordered magic square exists if and only if n ？ {2, 3}, and a rational diagonally ordered magic square exists if and only if n ≠2.

Asymptotic bound on binary self-orthogonal codes

We present two constructions for binary self-orthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the in-formation rate R = 1/2, by our constructive lower bound, the relative minimum distance δ≈ 0.0595 (for GV bound, δ≈ 0.110). Moreover, we have proved that the binary self-orthogonal codes asymptotically achieve the Gilbert-Varshamov bound.

LCD Codes and Self-orthogonal Codes in Finite Dihedral Group Algebras

Let Fq be a finite field with order q and D2n be the dihedral group with 2n elements, and gcd(q, 2n) = 1. In this article, the authors give precise descriptions and enumerations of linear complementary dual(LCD) codes and self-orthogonal codes in the finite dihedral group algebras Fq[D2n]. Some numerical examples are also presented to illustrate the main results.

ON CLASSICAL BCH CODES AND QUANTUM BCH CODES

It is a regular way of constructing quantum error-correcting codes via codes with self-orthogonal property, and whether a classical Bose-Chaudhuri-Hocquenghem (BCH) code is self-orthogonal can be determined by its designed distance. In this paper, we give the sufficient and necessary condition for arbitrary classical BCH codes with self-orthogonal property through algorithms. We also give a better upper bound of the designed distance of a classical narrow-sense BCH code which contains its Euclidean dual. Besides these, we also give one algorithm to compute the dimension of these codes. The complexity of all algorithms is analyzed. Then the results can be applied to construct a series of quantum BCH codes via the famous CSS constructions.

Duadic Codes over the Ring Fq[u] /m- and Their Gray Images

Let m ≥ 2 be any natural number and let be a finite non-chain ring, where and q is a prime power congruent to 1 modulo (m-1). In this paper we study duadic codes over the ring and their extensions. A Gray map from to is defined which preserves self duality of linear codes. As a consequence self-dual, formally self-dual and self-orthogonal codes over are constructed. Some examples are also given to illustrate this.

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.

On Constacyclic Codes over Zp1p2…pt

Let t ≥ 2 be an integer, and let p1, ···, ptbe distinct primes. By using algebraic properties, the present paper gives a sufficient and necessary condition for the existence of non-trivial self-orthogonal cyclic codes over the ring Zp1p2···ptand the corresponding explicit enumerating formula. And it proves that there does not exist any self-dual cyclic code over Zp1p2···pt.

On Proper and Exact Relative Homological Dimensions

In Enochs'relative homological dimension theory occur the(co)resolvent and(co)proper dimensions,which are defined by proper and coproper resolutions constructed by precovers and preenvelopes,respectively.Recently,some authors have been interested in relative homological dimensions defined by just exact sequences.In this paper,we contribute to the investigation of these relative homological dimensions.First we study the relation between these two kinds of relative homological dimensions and establish some transfer results under adjoint pairs.Then relative global dimensions are studied,which lead to nice characterizations of some properties of particular cases of self-orthogonal subcategories.At the end of this paper,relative derived functors are studied and generalizations of some known results of balance for relative homology are established.

Homological Dimensions Relative to Special Subcategories

Let A be an abelian category,C an additive,full and self-orthogonal subcategory of A closed under direct summands,rG(C)the right Gorenstein subcategory of A relative to C,and⊥C the left orthogonal class of C.For an object A in A,we prove that if A is in the right 1-orthogonal class of rG(C),then the C-projective and rG(C)-projective dimensions of A are identical;if the rG(C)-projective dimension of A is finite,then the rG(C)-projective and⊥C-projective dimensions of A are identical.We also prove that the supremum of the C-projective dimensions of objects with finite C-projective dimension and that of the rG(C)-projective dimensions of objects with finite rG(C)-projective dimension coincide.Then we apply these results to the category of modules.

Optimal binary codes and binary construction of quantum codes

This paper discusses optimal binary codes and pure binary quantum codes created using Steane construction. First, a local search algorithm for a special subclass of quasi-cyclic codes is proposed, then five binary quasi-cyclic codes are built. Second, three classical construction methods are generalized for new codes from old such that they are suitable for constructing binary self-orthogonal codes, and 62 binary codes and six subcode chains of obtained self-orthogonal codes are designed. Third, six pure binary quantum codes are constructed from the code pairs obtained through Steane construction. There are 66 good binary codes that include 12 optimal linear codes, 45 known optimal linear codes, and nine known optimal self-orthogonal codes. The six pure binary quantum codes all achieve the performance of their additive counterparts constructed by quaternary construction and thus are known optimal codes.

The Adjacency Codes of the First Yellow Graphs

The authors study the binary codes spanned by the adjacency matrices of the strongly regular graphs(SRGs)on at most two hundred vertices whose existence is unknown.The authors show that in length less than one hundred they cannot be cyclic,except for the exceptions of the SRGs of parameters(85,42,20,21)and(96,60,38,36).In particular,the adjacency code of a(85,42,20,21)is the zero-sum code.In the range[100,200]the authors find 29 SRGs that could possibly have a cyclic adjacency code.