Projective Reed–Muller type codes on rational normal scrolls

In this paper we study an instance of projective Reed–Muller type codes, i.e., codes obtained by the evaluation of homogeneous polynomials of a fixed degree in the points of a projective variety. In our case the variety is an important example of a determinantal variety, namely the projective surface known as rational normal scroll, defined over a finite field, which is the basic underlining algebraic structure of this work. We determine the dimension and a lower bound for the minimum distance of the codes, and in many cases we also find the exact value of the minimum distance. To obtain the results we use some methods from Gröbner bases theory.     

A new coding scheme of QC-LDPC codes for optical transmission systems

Based on Galois Field (GF(q)) multiplicative group, a new coding scheme for Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes is proposed, and the new coding scheme has some advantages such as the simpler construction, the easier implementation encoding, the lower complexity of the encoding and decoding, the more flexible adjustment of the code length as well as the code rate and so forth. Under the condition of considering the characteristics of optical transmission systems, an irregular QC-LDPC (3843,3603) code to be suitable for optical transmission systems is constructed by applying the proposed new coding scheme. The simulation result shows that the net coding gain (NCG) of the irregular QC-LDPC (3843,3603) code is respectively improved 2.14 dB, 1.19 dB, 0.24 dB and 0.14 dB more than those of the classic RS (255,239) code in ITU-T G.975, the LDPC (32640,30592) code in ITU-T G.975.1, the regular SCG-LDPC (3969,3720) code constructed by the Systematically Constructed Gallager (SCG) coding scheme and the regular QC-LDPC (4221,3956) code at the bit error rate (BER) of 10-8. Furthermore, all the five codes have the same code rate of 93.7%. Therefore, the irregular QC-LDPC (3843,3603) code constructed by the proposed new coding scheme has the more excellent error-correction performance and can be better suitable for optical transmission systems.     

The dual of a constacyclic code,self dual,reversible constacyclic codes and constacyclic codes with complementary duals over finite local Frobenius non-chain rings with nilpotency index 3

Over finite local Frobenius non-chain rings with nilpotency index 3 and when the length of the codes is relatively prime to the characteristic of the residue field of the ring, the structure of the dual of $\gamma$-constacyclic codes is established and the algebraic characterization of self-dual $\gamma$-constacyclic codes, reversible $\gamma$-constacyclic codes and $\gamma$-constacyclic codes with complementary dual are given. Generators for the dual code are obtained from those of the original constacyclic code.     

Weight enumerators of reducible cyclic codes and their dual codes

Let ${\mathbb{F}}_q$ be a finite field and $n$ a positive integer. In this paper, we find a new combinatorial method to determine weight enumerators of reducible cyclic codes and their dual codes of length $n$ over ${\mathbb{F}}_q$, which just generalize results of Zhu et al. (2015); especially, we also give the weight enumerator of a cyclic code, which is viewed as a partial Melas code. Furthermore, weight enumerators obtained in this paper are all in the form of power of a polynomial.     

The support designs of the triply even binary codes of length 48

In this paper, we present examples of codes all of whose weight classes support 1‐designs, with duals whose classes include two that support 2‐designs. We can find these examples in the triply even binary codes of length 48, which have been classified by Betsumiya and Munemasa.