Efficient algorithm for calculating short cycles in Tanner graph based on matrix computation

Loop distribution of Tanner graph affects the BER performance of low-density parity-check codes(LDPC) decoding.To count short cycles in the Tanner graph efficiently,a side by side recursion algorithm based on matrix computation was proposed.Firstly,5 basic graph structures were defined to realize recursive calculate in the implementation process.Compared with previous works,the algorithm provided many methods for counting the same length of cycles.The same result confirmed the correctness of the algorithm.The new algorithm could not only calculate the total number of cycles,but also gave the number each edge participating in fixed-length cycles.Its complexity was proportional to the product of D and square of N,where D was the average degree of variable nodes,and N denoted the code length.For LDPC codes,D was far less than N.For most of the LDPC codes,the calculation for numbers of cycle-length g、g+2、g+4 was only several seconds.     

Boolean operations on rasterized shapes represented by chain codes using space filling curves

This paper introduces a new algorithm for Boolean operations on rasterized geometric shapes that are represented with chain codes. The algorithm works in three steps. Firstly, the chain code symbols are transformed in the Hilbert space, where the overlaid chain code symbols are recognised. After that, a suitable starting cell is determined. Finally, the walk-about through the sequence of the initial chain code symbols is performed to obtain the sequence of chain code symbols representing the shape of the required Boolean operation. The algorithm is demonstrated on Freeman chain code in four directions. The time and space complexity of the proposed algorithm is linear, which was proven theoretically and confirmed by experiments.     

Important unanswered questions—1970

This paper was given as the opening address at the 1970 Albany International Conference on Radiation Effects in Semiconductors, and it attempts to establish a general overview of the field by concentrating on recent research developments and important unanswered questions. The continuing importance of impurity-defect interactions, of microscopic defect identification, and of the necessity for more theoretical calculations are emphasized. The rapid development of the field of ion implantation and its close relationship with radiation effects studies are pointed out. It is predicted that research in compound semiconductors will increase rapidly with close beneficial interaction with ion implantation studies.     

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.