CONGRUENCE OF SYMMETRIC INNER PRODUCTS OVER FINITE COMMUTATIVE RINGS OF ODD CHARACTERISTIC

Let $R$ be a finite commutative ring of odd characteristic and let $V$ be a free $R$-module of finite rank. We classify symmetric inner products defined on $V$ up to congruence and find the number of such symmetric inner products. Additionally, if $R$ is a finite local ring, the number of congruent symmetric inner products defined on $V$ in each congruence class is determined.

Artinian Local Rings Whose Annihilating-ideal Graphs Are Star Graphs

In this paper, a necessary and sufficient condition is given for a commutative Artinian local ring whose annihilating-ideal graph is a star graph. Also, a complete characterization is established for a finite local ring whose annihilating-ideal graph is a star graph.

UNITARY GROUPS OVER LOCAL RINGS

We study hermitian forms and unitary groups defined over a local ring, not necessarily commutative, equipped with an involution. When the ring is finite we obtain formulae for the order of the unitary groups as well as their point stabilizers, and use these to compute the degrees of the irreducible constituents of the Weil representation of a unitary group associated to a ramified quadratic extension of a finite local ring.

CYCLIC CODES THROUGH B[X], $B[X;\frac{1}{kp}Z_{0}]$ AND $B[X;\frac{1}{p^{k}}Z_{0}]$: A COMPARISON

It is very well known that algebraic structures have valuable applications in the theory of error-correcting codes. Blake [Codes over certain rings, Inform. and Control 20 (1972) 396–404] has constructed cyclic codes over ℤm and in [Codes over integer residue rings, Inform. and Control 29 (1975), 295–300] derived parity check-matrices for these codes. In [Linear codes over finite rings, Tend. Math. Appl. Comput. 6(2) (2005) 207–217]. Andrade and Palazzo present a construction technique of cyclic, BCH, alternant, Goppa and Srivastava codes over a local finite ring B. However, in [Encoding through generalized polynomial codes, Comput. Appl. Math. 30(2) (2011) 1–18] and [Constructions of codes through semigroup ring [Formula: see text] and encoding, Comput. Math. Appl. 62 (2011) 1645–1654], Shah et al. extend this technique of constructing linear codes over a finite local ring B via monoid rings [Formula: see text], where p = 2 and k = 1, 2, respectively, instead of the polynomial ring B[X]. In this paper, we construct these codes through the monoid ring [Formula: see text], where p = 2 and k = 1, 2, 3. Moreover, we also strengthen and generalize the results of [Encoding through generalized polynomial codes, Comput. Appl. Math.30(2) (2011) 1–18] and [Constructions of codes through semigroup ring [Formula: see text]] and [Encoding, Comput. Math. Appl.62 (2011) 1645–1654] to the case of k = 3.

The Weil Character of the Unitary Group Associated to a Finite Local Ring

LetR/R be a quadratic extension of finite, commutative, local and principal rings of odd characteristic. Denote byUn(R) the unitary group of ranknassociated toR/R. The Weil representation ofUn(R) is defined and its character is explicitly computed.