Let $R\ $be a commutative ring with $1\neq0$ and $M$ be an $R$-module. Suppose that $S\subseteq R\ $is multiplicatively closed set of $R.\ $Recently Sevim et al. in \cite{SenArTeKo} introduced the notion $S$-prime submodule which is generalization prime used them to characterize certain classes rings/modules such as submodules, simple modules, torsion free modules,\ $S$-Noetherian modules etc. ...

The McEliece cryptosystem is one of the oldest public-key cryptosystem ever designated. It is also the first public-key cryptosystem based on linear error-correcting codes. The main advantage of the McEliece cryptosystem is to have a very fast encryption and decryption functions but suffers from a major drawback. It requires a very large public key which makes it very difficult to use in many p...

This paper presents the construction of large girth Quasi-Cyclic low density parity check (QC-LDPC) codes. The row groups are paired two times the row weight which has cut down hardware implementation cost and complexity as compared to the connection of individual columns and rows. The construction of newly obtained codes gives a class of efficiently encodable quasi-cyclic LDPC codes.

Six new quasi-cyclic codes are presented, which improve the lower bounds on the minimum distance for a binary code. A local exhaustive search is used to find these codes and many other quasi-cyclic codes which attain the lower bounds.

In this paper we obtain a number of [70,35,12] singly even self-dual codes as a quasi-cyclic codes with m=2 (tailbitting convolutional codes). One of them is the first known code with parameters Beta=140 Gamma=0. All codes are not pure double circulant i.e. could not be represented in systematic form. Keywords—convolutional encoding, quasi-cyclic codes weight enumeratorg, double circulant

For positive integers n and l, we study the cyclic U(gl n )-module generated by the l-th power of the α-determinant det(X). This cyclic module is isomorphic to the n-th tensor space (Sym(C)) of the symmetric l-th tensor space of C for all but finite exceptional values of α. If α is exceptional, then the cyclic module is equivalent to a proper submodule of (Sym(C)), i.e. the multiplicities of se...

A new algebraic approach to quasi-cyclic codes is introduced. The key idea is to regard a quasi-cyclic code over a field as a linear code over an auxiliary ring. By the use of the Chinese Remainder Theorem (CRT), or of the Discrete Fourier Transform (DFT), that ring can be decomposed into a direct product of fields. That ring decomposition in turn yields a code construction from codes of lower ...

The modular multilevel converter (MMC) is receiving extensive research interests in high/medium voltage applications due to its modularity, scalability, reliability, high voltage capability and excellent harmonic performance. The submodule capacitors are usually quite bulky since they have to withstand fundamental frequency voltage fluctuations. To reduce the capacitance of these capacitors, th...